Total completion time minimization on multiple machines subject to machine availability and makespan constraints

DOI10.1016/j.ejor.2014.12.012zbMath1346.90352OpenAlexW2031847401MaRDI QIDQ319146

Hairong Zhao, Yumei Huo

Publication date: 6 October 2016

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.12.012

zbMATH Keywords

schedulingpolynomial time algorithmparallel machinebi-criterialimited machine availability

Mathematics Subject Classification ID

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

Related Items (6)

Multitasking via alternate and shared processing: algorithms and complexity ⋮ A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach ⋮ Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions ⋮ Scheduling with time-of-use costs ⋮ Parallel machine makespan minimization subject to machine availability and total completion time constraints ⋮ Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints
• Capacitated two-parallel machines scheduling to minimize sum of job completion times
• Complexity of single machine, multi-criteria scheduling problems
• Current trends in deterministic scheduling
• Preemptive scheduling with variable profile, precedence constraints and due dates
• Scheduling with limited machine availability
• Multicriteria scheduling
• Scheduling with Deadlines and Loss Functions
• Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
• 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: Total completion time minimization on multiple machines subject to machine availability and makespan constraints