Suchergebnisse - Scheduling . Non-availability constraint . Approximation

Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints von Kacem, Imed, Kellerer, Hans

“… The third problem is associated with a non-availability constraint. In the fourth one, the non-availability interval is related to the operator who is organizing the execution of jobs on the machine …”
Volltext

A PTAS for non-resumable open shop scheduling with an availability constraint von Yuan, Yuan, Lan, Yan, Ding, Ning, Han, Xin

“… Shop scheduling problem is one of the most classical problems in combinatorial optimization …”
Volltext

Scheduling resumable deteriorating jobs on a single machine with non-availability constraints von Fan, Baoqiang, Li, Shisheng, Zhou, Li, Zhang, Liqi

“… We consider a problem of scheduling resumable deteriorating jobs on a single machine with non-availability constraints …”
Volltext

A Computational Study of the Two-Machine No-Wait Flow Shop Scheduling Problem Subject to Unequal Release Dates and Non-Availability Constraints von Labidi, Mohamed, Kooli, Anis, Ladhari, Talel, Gharbi, Anis, Suryahatmaja, Umar S.

“… We consider the problem of scheduling a set of jobs subject to unequal release dates on a two-machine flow shop where the no-wait and non-availability constraints are considered so as to minimize the makespan …”
Volltext

Approximation results for flow shop scheduling problems with machine availability constraints von Kubzin, Mikhail A., Potts, Chris N., Strusevich, Vitaly A.

“… ) -approximation algorithm. For the problem with one non-availability interval under the semi-resumable scenario, a polynomial-time approximation scheme is developed …”
Volltext

Single-machine scheduling with operator non-availability to minimize total weighted completion time von Wan, Long, Yuan, Jinjiang

“… In this paper, we investigate the single-machine scheduling with an operator non-availability period to minimize total weighted completion time, where the operator non-availability period is an open …”
Volltext

Single machine scheduling with small operator-non-availability periods von Rapine, Christophe, Brauner, Nadia, Finke, Gerd, Lebacque, Vassilissa

“… of each of the experiments. This gives rise to a new type of scheduling problem, namely problems of finding schedules with time periods when the tasks can neither start nor finish …”
Volltext

No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates von Ben Chihaoui, Faten, Kacem, Imed, Hadj-Alouane, Atidel B., Dridi, Najoua, Rezg, Nidhal

“… In this paper, we consider the two-machine no-wait flow-shop scheduling problem, when every machine is subject to one non-availability constraint and jobs have different release dates …”
Volltext

Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval von Kacem, Imed

“… In this article, we consider the non-resumable case of the single machine scheduling problem with a fixed non-availability interval …”
Volltext

Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval von Kacem, Imed, Mahjoub, A. Ridha

“… In a recent paper [ Theoretical Computer Science 363, 257–265], He, Zhong and Gu considered the non-resumable case of the scheduling problem with a fixed non-availability interval under the non-resumable scenario …”
Volltext

Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time von Chen, Yong, Zhang, An, Tan, Zhiyi

“… This paper considers the single machine scheduling problem with an operator non-availability period …”
Volltext

Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval von Kacem, Imed

“… In this article, we consider the non-resumable case of the single machine scheduling problem with a fixed non-availability interval …”
Volltext

Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates von Kacem, Imed, Kellerer, Hans

“… This paper is the first attempt to successfully design efficient approximation algorithms for the single-machine weighted flow-time minimization problem when jobs have different release dates …”
Volltext

Single machine scheduling with non-availability interval and optional job rejection von Mor, Baruch, Shapira, Dana

“… This paper studies the single machine scheduling problem with availability constraints and optional job rejection …”
Volltext

Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval von Kellerer, Hans, Kubzin, Mikhail A., Strusevich, Vitaly A.

“… In this note, we consider the scheduling problem of minimizing the sum of the weighted completion times on a single machine with one non-availability interval on the machine under the non-resumable scenario …”
Volltext

Keynote 5: "Scheduling with non-availability constraints: Offline and semi-online scenarios" von Kacem, Imed, Cunha, Telmo, Botta-Genoulaz, Valerie

“… This talk will summarize the main characteristics of the scheduling problems and introduce the non-availability constraints' context …”
Volltext

Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals von Kacem, Imed, Kellerer, Hans, Lanuel, Yann

“… In this paper we consider the maximization of the weighted number of early jobs on a single machine with non-availability constraints …”
Volltext

Non-preemptive two-machine open shop scheduling with non-availability constraints von Breit, J., Schmidt, G., Strusevich, V. A.

“… We consider approximability issues of the problem with more than one non-availability intervals and present an approximation algorithm with a worst-case ratio of 4/3 for the problem with a single non …”
Volltext

Effective algorithms for scheduling problems under non-availability constraints (Invited paper) von Kacem, Imed

“… In this paper, we consider some practical scheduling problems under unavailability constraints …”
Volltext

Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability von Kacem, Imed, Paschos, Vangelis Th

“… Such a study considers the weighted completion time minimization on a single machine with a fixed non-availability interval …”
Volltext