Scheduling with limited machine availability

Schmidt, Günter

doi:10.1016/s0377-2217(98)00367-1

Cited by 426 publications

(156 citation statements)

References 32 publications

Supporting

Mentioning

155

Contrasting

Unclassified

Order By: Relevance

“…Most research has concentrated on a pure deterministic situation when the start of an unavailability interval and its duration are known in advance. There are several good surveys that address various aspects and provide results for models of this type, namely those of Lee (1996), Sanlaville and Schmidt (1998), Schmidt (2000) and Lee (2004). There are several different interpretations of how the processing of jobs is affected by an MNAI, denoted by I.…”

Section: Scheduling With Machine Availability Constraintsmentioning

confidence: 99%

Fifty years of scheduling: a survey of milestones

Potts

Strusevich

2009

Journal of the Operational Research Society

170

View full text Add to dashboard Cite

Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear. A discussion of the main topics of scheduling research for the past five decades is provided, highlighting the key contributions that helped shape the subject. The main topics covered in the respective decades are combinatorial analysis, branch and bound, computational complexity and classification, approximate solution algorithms, and enhanced scheduling models.

show abstract

Section: Scheduling With Machine Availability Constraintsmentioning

confidence: 99%

Fifty years of scheduling: a survey of milestones

Potts

Strusevich

2009

Journal of the Operational Research Society

170

View full text Add to dashboard Cite

show abstract

“…Only recently has this issue begun to get the attention that it deserves. For example, see Adiri et al [1] and Albers and Schmidt [5] for research on scheduling subject to random machine breakdown, Lee [12] for scheduling research in presence of preventive maintenance, and Schmidt [15] for a review on machine availability. Scheduling subject to tool change, while it is more common and frequent, has not been addressed thus far.…”

Section: Introductionmentioning

confidence: 99%

Scheduling with tool changes to minimize total completion time: Basic results and SPT performance

Aktürk

Ghosh

Güneş

2004

European Journal of Operational Research

View full text Add to dashboard Cite

We consider a single machine sequencing problem subject to tool wear, where the objective is to minimize the total completion time. We briefly describe the problem and discuss its properties, complexity and solution. Mainly, however, we focus on the performance of the SPT list-scheduling heuristic. We provide theoretical worst-case bounds on SPT performance and also demonstrate its empirical behavior.

show abstract

“…[21,22,31,32,35] for some references on the problem for different settings). Most of the works on flowshops are restricted to the 2-machine case (see [5,7,8,10,11,24,36,37]), and only [2][3][4]28] consider the case for more than 3 machines.…”

mentioning

confidence: 99%

Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

González

2009

Computers & Operations Research

View full text Add to dashboard Cite

In this paper, we address the problem of scheduling a set of jobs in a flowshop with makespan objective. In contrast to the usual assumption of machine availability presented in most research, we consider that machines may not be available at the beginning of the planning period, due to processing of previously scheduled jobs. We first formulate the problem, analyse the structure of solutions depending on a number of factors (such as machines, jobs, structure of the processing times, availability vectors, etc.), and compare it with its classical counterpart. Results indicate that the problem under consideration presents a different structure of solutions, and that it is easier than the classical permutation flowshop problem. In view of these results, we propose and test a number of fast heuristics for the problem.

show abstract

Scheduling with limited machine availability

Cited by 426 publications

References 32 publications

Fifty years of scheduling: a survey of milestones

Fifty years of scheduling: a survey of milestones

Scheduling with tool changes to minimize total completion time: Basic results and SPT performance

Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

Contact Info

Product

Resources

About