HEURISTIC ALGORITHMS FOR SCHEDULING IN A MULTIPROCESSOR TWO-STAGE FLOWSHOP WITH 0-1 RESOURCE REQUIREMENTS

Ewa Figielska

Abstract

This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines at the first stage and a single machine at the second stage. At the first stage, jobs use some additional resources which are available in limited quantities at any time. The resource requirements are of 0-1 type. The objective is the minimization of makespan. The problem is NP-hard. Heuristic algorithms are proposed which, while solving to optimality the resource constrained scheduling problem at the first stage of the flowshop, select for simultaneous processing jobs according to rules promising a good (short) schedule in the flowshop. Several rules of job selection are considered. The performance of the proposed heuristic algorithms is analyzed by comparing their solutions with the lower bound on the optimal makespan. The results of computational experiments show that these heuristics are able to produce near-optimal solutions in short computation time.

References

  1. Brah, S.A. and L.L. Loo (1999). Heuristics for scheduling in a flow shop with multiple processors. Europ. J. of Opernl Res.113,113-112
  2. Chen, B. (1995). Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage, J. of Opernl Res. Soc. 46, 234- 244.
  3. Gupta J.N.D. (1988). Two stage hybrid flowshop scheduling problem. J. of Opernl Res. Soc. 39, 359- 364.
  4. Haouari, M. and R. M'Hallah (1997). Heuristic algorithms for the two-stage hybrid flowshop problem, Oper. Res. Let. 21, 43-53.
  5. Hoogeveen J.A., J.K. Lenstra and B. Veltman (1996). Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard. Europ. J. of Opernl Res. 89, 172-175.
  6. Linn, R, W. Zhang (1999). Hybrid flow shop scheduling: a survey. Comp. and Ind. Engin. 37, 57-61.
  7. Ruiz, R., C. Maroto (2006). A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. Europ. J. of Opernl Res. 169, 781- 800.
  8. Slowinski, R. (1980), Two approaches to problems of resource allocation among project acticities - A comparative study. J. Opl Res. Soc. 31, 711-723.
  9. Slowinski, R. (1981), L'ordonanacement des taches preemptives sur les processeurs independants en presence de ressources supplementaires. RAIRO Inform./Comp. Science, vol.15, No.2, 155-166.
Download


Paper Citation


in Harvard Style

Figielska E. (2007). HEURISTIC ALGORITHMS FOR SCHEDULING IN A MULTIPROCESSOR TWO-STAGE FLOWSHOP WITH 0-1 RESOURCE REQUIREMENTS . In Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-972-8865-82-5, pages 452-455. DOI: 10.5220/0001643404520455


in Bibtex Style

@conference{icinco07,
author={Ewa Figielska},
title={HEURISTIC ALGORITHMS FOR SCHEDULING IN A MULTIPROCESSOR TWO-STAGE FLOWSHOP WITH 0-1 RESOURCE REQUIREMENTS},
booktitle={Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2007},
pages={452-455},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001643404520455},
isbn={978-972-8865-82-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - HEURISTIC ALGORITHMS FOR SCHEDULING IN A MULTIPROCESSOR TWO-STAGE FLOWSHOP WITH 0-1 RESOURCE REQUIREMENTS
SN - 978-972-8865-82-5
AU - Figielska E.
PY - 2007
SP - 452
EP - 455
DO - 10.5220/0001643404520455