Single machine scheduling with small operator-non-availability periods

Rapine, Christophe; Brauner, Nadia; Finke, Gerd; Lebacque, Vassilissa

doi:10.1007/s10951-012-0269-x

Cited by 18 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In contrast, a Fse instant only prevents the start or the completion of a job: the machine can go on processing its current job. Brauner et al [4] and Rapine et al [15] study a scheduling problem with similar constraints: an operator non-availability (Ona) period is defined as an open time interval in which no job can start nor end. With the makespan as objective criterion, they prove the problem to be NP-hard and not in APX even if the duration of any Ona period is smaller than the processing time of any job.…”

Section: Notations and Preliminary Definitionsmentioning

confidence: 99%

A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times

Rapine

Brauner

2013

Discrete Optimization

Self Cite

View full text Add to dashboard Cite

International audienceWe consider the problem of scheduling independent jobs on a single resource under a special unavailability constraint: a set of forbidden instants is given, where no job is allowed to start or complete. We show that a schedule without idle time always exists if the number of forbidden instants is less than the number of distinct processing times appearing in the instance. We derive quite a fast algorithm to find such a schedule, based on an hybridization between a list algorithm and local exchange. As a corollary minimizing the makespan for a fixed number of forbidden instants is polynomia

show abstract

Section: Notations and Preliminary Definitionsmentioning

confidence: 99%

A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times

Rapine

Brauner

2013

Discrete Optimization

Self Cite

View full text Add to dashboard Cite

show abstract

“…This is due to lack of coordination between operators (or production planning personnel) and maintenance personnel." In a somewhat different setting from the chemical industry discussed by Rapine et al (2012), jobs require intervention by an operator at their start and termination, and the machine may become unavailable as a consequence of operator unavailability.…”

Section: Introductionmentioning

confidence: 99%

Single-machine common due date total earliness/tardiness scheduling with machine unavailability

Bülbül

Kedad-Sidhoum

Şen

2018

J Sched

View full text Add to dashboard Cite

Research on non-regular performance measures is at best scarce in the deterministic machine scheduling literature with machine unavailability constraints. Moreover, almost all existing works in this area assume either that processing on jobs interrupted by an interval of machine unavailability may be resumed without any additional setup/processing or that all prior processing is lost. In this work, we intend to partially fill these gaps by studying the problem of scheduling a single machine as to minimize the total deviation of the job completion times from an unrestrictive common due date when one or several fixed intervals of unavailability are present in the planning horizon. We also put a serious effort into investigating models with semi-resumable jobs so that processing on a job interrupted by an interval of machine unavailability may later be resumed at the expense of some extra processing time. The conventional assumptions regarding resumability are also taken into account. Several interesting cases are identified and explored, depending on the resumability scheme and the location of the interval of machine unavailability with respect to the common due date. The focus of analysis is on structural properties and drawing the boundary between polynomially solvable and NP−complete cases. Pseudo-polynomial dynamic programming algorithms are devised for NP−complete variants in the ordinary sense.

show abstract

“…Rapine et al [21] have described some applications of operator non-availability problems in the planning of a chemical experiments. Brauner et al [1] have studied single-machine problems under the operator non-availability constraint.…”

Section: Introductionmentioning

confidence: 99%

Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints

Kacem¹,

Kellerer²

2018

Algorithmica

View full text Add to dashboard Cite

In this paper, we consider four single-machine scheduling problems with release times, with the aim of minimizing the maximum lateness. In the first problem we have a common deadline for all the jobs. The second problem looks for the Pareto frontier with respect to the two objective functions maximum lateness and makespan. The third problem is associated with a non-availability constraint. In the fourth one, the non-availibility interval is related to the operator who is organizing the execution of jobs on the machine (no job can start, and neither can complete during the operator non-availability period). For each of the four problems, we establish the existence of a polynomial time approximation scheme (PTAS).

show abstract

Single machine scheduling with small operator-non-availability periods

Cited by 18 publications

References 18 publications

A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times

A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times

Single-machine common due date total earliness/tardiness scheduling with machine unavailability

Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints

Contact Info

Product

Resources

About