Capacitated two-parallel machines scheduling to minimize sum of job completion times

Lee, Chung‐Yee; Liman, Surya Danusaputro

doi:10.1016/0166-218x(90)90055-h

Cited by 87 publications

(30 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They give a simpler proof of NP-hardness and find a tight performance bound of 9/7 for the SPT rule. Lee and Liman [11] also consider the scheduling problem of minimizing total completion time with two parallel machines where one machine is always available and the other is available from time zero up to a fixed point in time. They give the NP-hardness proof for the problem and provide a pseudo-polynomial dynamic programming solution.…”

Section: Introductionmentioning

confidence: 99%

Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance

Aktürk

Ghosh

Güneş

2002

Naval Research Logistics

View full text Add to dashboard Cite

Abstract:The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a tool change is caused most frequently by tool wear. That is why we consider here the problem of scheduling a set of jobs on a single CNC machine where the cutting tool is subject to wear; our objective is to minimize the total completion time. We first describe the problem and discuss its peculiarities. After briefly reviewing available theoretical results, we then go on to provide a mixed 0 -1 linear programming model for the exact solution of the problem; this is useful in solving problem instances with up to 20 jobs and has been used in our computational study. As our main contribution, we next propose a number of heuristic algorithms based on simple dispatch rules and generic search. We then discuss the results of a computational study where the performance of the various heuristics is tested; we note that the well-known SPT rule remains good when the tool change time is small but deteriorates as this time increases and further that the proposed algorithms promise significant improvement over the SPT rule.

show abstract

Section: Introductionmentioning

confidence: 99%

Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance

Aktürk

Ghosh

Güneş

2002

Naval Research Logistics

View full text Add to dashboard Cite

show abstract

“…Lee [13] studies a parallel-machine problem where machines are available starting from different times. Lee and Liman [18] consider a two-parallel-machine problem where one machine has an availability constraint. Mosheiov [20] studies the same problem by assuming that each machine is available during an interval.…”

Section: Introductionmentioning

confidence: 99%

Scheduling jobs and maintenance activities on parallel machines

Lee

Chen

2000

Naval Research Logistics

Self Cite

181

View full text Add to dashboard Cite

“…Lee [16] studies the problem of parallel identical machine scheduling with nonsimultaneous machine available times at the beginning of the planning horizon. Lee and Liman [22] study the two-parallel-machine scheduling problem for minimizing total completion time where one machine has an availability constraint. Mosheiov [27] studies the same problem by assuming that each machine is available in an interval.…”

Section: Introductionmentioning

confidence: 99%