Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

DOI10.1016/S0167-5060(08)70356-XzbMath0411.90044OpenAlexW1488422606WikidataQ89365055 ScholiaQ89365055MaRDI QIDQ4198327

Alexander H. G. Rinnooy Kan, Eugene L. Lawler, Ronald L. Graham, Jan Karel Lenstra

Publication date: 1979

Published in: Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70356-x

zbMATH Keywords

surveycomputational complexitycomprehensive bibliographydeterministic scheduling problemsoptimization and approximation algorithmssingle machine, parallel machine, open shop, flow shop and job shop problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)