7 research outputs found
Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
2006-2007 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
2006-2007 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
This paper studies the two-machine flowshop scheduling problem with anticipatory
setup times and an availability constraint imposed on only one of the machines where
interrupted jobs can resume their operations. We present a heuristic algorithm from
Wang and Cheng to minimize makespan and use simulation to determine the actual
error bound
An Improved Approximation Algorithm for Two-Machine Flow Shop Scheduling With an Availability Constraint
We study the problem of scheduling n jobs in a two-machine flow shop where the second machine is not available for processing during a given time interval. A resumable scenario is assumed, i.e if a job cannot be finished before the down period it is continued after the machine becomes available again. The objective is to minimize the makespan. The best fast approximation algorithm for this problem guarantees a relative worst-case error bound of 4/3. We present an improved algorithm with a relative worst-case error bound of 5/4
Recommended from our members
Shop scheduling with availability constraints
Scheduling Theory studies planning and timetabling of various industrial and human activities and, therefore, is of constant scientific interest. Being a branch of Operational Research, Theory of Scheduling mostly deals with problems of practical interest which can be easily (from a mathematical point of view) solved by full enumeration and at the same time usually require enormous time to be solved optimally. Therefore, one attempts to develop algorithms for finding optimal or near optimal solutions of the problems under consideration in reasonable time. If the output of an algorithm is not always an optimal solution then the worst-case analysis of this algorithm is undertaken in order to estimate either a relative error or an absolute error that holds for any given instance of the problem.
Scheduling problems which are usually considered in the literature assume that the processing facilities are constantly available throughout the planning period. However, in practice, the processing facility, e.g. a machine, a labour, etc. can become non-available due to various reasons, e.g. breakdowns, lunch breaks, holidays, maintenance work, etc. All these facts stimulate research in the area of scheduling with non-availability constraints. This branch of Scheduling Theory has recently received a lot of attention and a considerable number of research papers have been published. This thesis is fully dedicated to scheduling with non-availability constraints under various assumptions on the structure of the processing system and on the types of non-availability intervals