Parallel-machine Scheduling with Precedence Constraints and Controllable Job-processing Times

Kailiang Xu, Rong Fei, Gang Zheng

2017

Abstract

A parallel-machine scheduling problem with tree-formed precedence constraints is studied, where jobprocessing times can be compressed by allocating extra resource to the jobs. A tabu-search algorithm is developed in this paper, which searches for the near optimal solutions based on the structural characteristics of the problem. Experiment shows the algorithm is capable for providing satisfactory schedules for media and large-sized problems within acceptable computing time.

References

  1. Graham. R.L., Lawler. E.L., Lenstra. J.K., Rinnooy. A.H.G., 1979. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5: 287-326.
  2. Vickson., 1980. Two single machine sequencing problems involving controllable job processing times. AIIE Transactions, 12(3): 258-262.
  3. Cheng. T.C.E, Kovalyov. M.Y., Shakhlevich. N., 2006. Scheduling with controllable release dates and processing times: total completion time minimization. European Journals of Operations Research, 175: 769- 781.
  4. Janiak. A., 1991. Single machine scheduling problem with common deadline and resource dependent release dates. European Journal of Operational Research, 53: 317-325.
  5. Shabtay. D., Kaspi. M., 2004. Minimizing the total weighted flow time in a single machine with controllable processing times. Computers and Operations Research, 31(13): 2279-2280.
  6. Shabtay. D., Kaspi. M., 2006. Parallel machine scheduling with a convex resource consumption function. European Journal of Operational Research, 173(1): 92- 107.
  7. Shabtay. D., Steiner. G., 2007. A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13): 1643-1666.
  8. Alidaee. B., Ahmadian. A., 1993. Two parallel machine sequencing problems involving controllable job processing times. European Journal of Operations Research, 70: 335-341.
  9. Jansen. K., Mastrolilli. M., 2004. Approximation schemes for parallel machine scheduling problem with controllable processing times. Computers and Operations Research, 31: 1565-1581.
  10. Xu. K.L., Feng. Z.R., Ke. L.J., 2010, A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates. Computers and Operations Research, 37: 1924-1938.
  11. Glover. F., 1990. Tabu search: a tutorial. Interfaces, 20(4): 665-679.
  12. Dell'Amico. M., Trubian. M., Applying tabu-search to the job shop scheduling problems. Annals of Operations Research, 22: 231-252.
  13. Bilge. U., Kirac. F., Kurtulan. M., Pekgun. P., 2004. A tabu search algorithm for parallel machine total tardiness problem. Computers and Operations Research, 31(3): 397-414.
  14. Venditti. L., Pacciarelli. D., Meloni. C., 2010. A tabu search algorithm for scheduling pharmaceutical packaging operations. European Journal of Operations Research, 202(2): 538-546.
  15. Nowicki., 1995. A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times. Discrete Appl. Math, 63: 23-256.
  16. Fulkerson. D.R., 1961. A network flow computation for project cost curves. Management Science, 167-178.
  17. Pinedo. M., 2012. Scheduling: Theory, Algorithms, and Systems. Springer-Verlag. New York, 4th edition.
Download


Paper Citation


in Harvard Style

Xu K., Fei R. and Zheng G. (2017). Parallel-machine Scheduling with Precedence Constraints and Controllable Job-processing Times . In Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-218-9, pages 470-476. DOI: 10.5220/0006290804700476


in Bibtex Style

@conference{icores17,
author={Kailiang Xu and Rong Fei and Gang Zheng},
title={Parallel-machine Scheduling with Precedence Constraints and Controllable Job-processing Times},
booktitle={Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2017},
pages={470-476},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006290804700476},
isbn={978-989-758-218-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Parallel-machine Scheduling with Precedence Constraints and Controllable Job-processing Times
SN - 978-989-758-218-9
AU - Xu K.
AU - Fei R.
AU - Zheng G.
PY - 2017
SP - 470
EP - 476
DO - 10.5220/0006290804700476