Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints

DOI10.1016/j.tcs.2010.12.007zbMath1208.90065OpenAlexW2030605144MaRDI QIDQ631768

Yumei Huo, Hairong Zhao

Publication date: 14 March 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.007

zbMATH Keywords

bicriteria schedulingmakespanpolynomial time algorithmstotal completion timemachine availability constrainttwo machine

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Total completion time minimization on multiple machines subject to machine availability and makespan constraints ⋮ Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods ⋮ Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval ⋮ Parallel machine makespan minimization subject to machine availability and total completion time constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of single machine, multi-criteria scheduling problems
• Preemptive scheduling with variable profile, precedence constraints and due dates
• Scheduling with limited machine availability
• Multicriteria scheduling
• Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines
• Minimizing Schedule Length Subject to Minimum Flow Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing Total Completion Time on Parallel Machines with Deadline Constraints
• A note on scheduling parallel machines subject to breakdown and repair

This page was built for publication: Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints