Schedule Two-machine Flow-shop with Controllable Processing Times Using Tabu-search

Kailiang Xu, Gang Zheng

Abstract

A two-machine flow-shop scheduling problem with controllable processing times modeled by a non-linear convex resource consumption function is considered in this paper. The objective is to minimize the resource consumption that is needed to control the makespan not to exceed the given deadline. The problem is proved to be strongly NP-hard. An optimal resource allocation algorithm is designed to calculate the optimal processing times of the jobs, while the optimal or near-optimal processing sequence of the jobs is determined by a heuristic or a tabu-search algorithm.

References

  1. Bilge, U., Kirac, F., Kurtulan, M., and Pekgun, P. (2004). A tabu search algorithm for parallel machine total tardiness problem. 31(3):397-414.
  2. D. Biskup, H. J. (2001). Common due date assignment for scheduling on a single machine with jointly reducible processing times. Int. J. Production Economics, 69(3):317-322.
  3. Glover, F. (1989). Tabu search. part i. ORSA Journal of Computing, 1(1):190-206.
  4. Graham, R., Lawler, E., Lenstra, J., and Rinnooy, A. K. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5(1):287-326.
  5. Janiak, A. (1986). One-machine scheduling problems with resource constraints. Lecture Notes in Computer Science, 84(1):358-364.
  6. Janiak, A. (1989). Minimization of the blooming mill standstills - mathematical model, suboptimal algorithms. Mechanika, 8(2):37-49.
  7. Janiak, A. (1998). Minimization of the makespan in a two-machine problem under given resource constraints. European Journal of Operations Research, 107(1):325C337.
  8. Janiak, A., Kozan, E., Lichtenstein, M., and Oguz, C. (2007). Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. International Journal of Production Economics, 105(2):407-424.
  9. M. Kaspi, D. S. (2006). A bicriterion approach to time cost trade-offs in scheduling with convex resourcedependent job processing times and release dates. 33(1):3015-3033.
  10. Monma, C., Schrijver, A., Todd, M., and Wei, V. (1990). Convex resource allocation problems on directed acyclic graphs: duality,complexity,special cases and extensions. Mathematics of Operations Research, 15(4):736-748.
  11. Nowicki, E. (1993). An approximation algorithm for the mmachine permutation flow shop scheduling problem with controllable processing times. European Journal of Operations Research, 70(3):342C349.
  12. Shabtay, D. and Kaspi, M. (2006). Parallel machine scheduling with a convex resource consumption function. European Journal of Operations Research, 173(1):92-107.
  13. Shabtay, D., Kaspi, M., and Steiner, G. (2007). The no-wait two-machine flow-shop scheduling problem with convex resource-dependent processing times. IIE Trans, 39(5):539C557.
  14. Shabtay, D. and Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155.
  15. Xu, K. and Feng, Z. (2010). A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to met due dates. Annals of Operations Research, 181(1):303-324.
  16. Xu, K., Feng, Z., and Jun, K. (2010). A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates. 37(11):1924-1938.
Download


Paper Citation


in Harvard Style

Xu K. and Zheng G. (2015). Schedule Two-machine Flow-shop with Controllable Processing Times Using Tabu-search . In Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-075-8, pages 14-22. DOI: 10.5220/0005204300140022


in Bibtex Style

@conference{icores15,
author={Kailiang Xu and Gang Zheng},
title={Schedule Two-machine Flow-shop with Controllable Processing Times Using Tabu-search},
booktitle={Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2015},
pages={14-22},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005204300140022},
isbn={978-989-758-075-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Schedule Two-machine Flow-shop with Controllable Processing Times Using Tabu-search
SN - 978-989-758-075-8
AU - Xu K.
AU - Zheng G.
PY - 2015
SP - 14
EP - 22
DO - 10.5220/0005204300140022