Single Machine Group Scheduling with Two Ordered Criteria

DOI10.1057/jors.1996.27zbMath0851.90061OpenAlexW2023180172WikidataQ58616934 ScholiaQ58616934MaRDI QIDQ4887789

Mikhail Y. Kovalyov, Cheng, T. C. Edwin, Alexander V. Tuzikov

Publication date: 26 September 1996

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1996.27

zbMATH Keywords

single machinepolynomial time algorithmtotal weighted completion timescheduling jobsbicriterion group scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Single-machine bicriterion group scheduling with deteriorating setup times and job processing times ⋮ An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes ⋮ Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom ⋮ The study of group scheduling problems with general dual-position-based job processing times ⋮ Single machine scheduling with assignable due dates to minimize maximum and total late work ⋮ Single-machine group scheduling problems with deterioration consideration ⋮ A note on single-machine group scheduling problems with position-based learning effect ⋮ Single-machine group scheduling problems with deteriorated and learning effect ⋮ Single-machine group scheduling problems with deteriorating and learning effect ⋮ Bicriterion scheduling with group technology and deterioration effect ⋮ A single-machine group schedule with fuzzy setup and processing times