Author:
Chen Zhi-Long,Hall Nicholas G.
Publisher
Springer International Publishing
Reference105 articles.
1. Adiri, I., & Amit, N. (1984). Openshop and flowshop scheduling to minimize sum of completion times. Computers & Operations Research, 11, 275–284.
2. Adiri, I., Bruno, J., Frostig, E., & Rinnooy Kan, A. H. G. (1989) Single machine flow-time scheduling with a single breakdown. Acta Informatica, 26, 679–696.
3. Alidaee, B., & Ahmadian, A. (1993). Two parallel machine sequencing problems involving controllable job processing times. European Journal of Operational Research, 70, 335–341.
4. Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985–1032.
5. Atay, A., Calleja, P., & Soteras, S. (2019). Open shop scheduling games. Working paper, Hungarian Academy of Sciences, July.