Minimizing the sum of job completion times on capacitated two-parallel machines

DOI10.1016/j.ejor.2008.07.018zbMath1159.90519OpenAlexW2074951241MaRDI QIDQ1014943

Ching-Jong Liao, Chien-Wen Chao, Chien-Hung Lin

Publication date: 30 April 2009

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

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

zbMATH Keywords

branch and bound algorithmparallel machine schedulingavailability constraints

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (5)

Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines ⋮ Parallel machines scheduling with machine maintenance for minsum criteria ⋮ Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem ⋮ Online scheduling of malleable parallel jobs with setup times on two identical machines ⋮ A note on ``A mixed integer programming model for advanced planning and scheduling (APS)

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel machines scheduling with nonsimultaneous machine available time
• Capacitated two-parallel machines scheduling to minimize sum of job completion times
• Minimizing the sum of job completion times on capacitated parallel machines
• Scheduling with limited machine availability
• Scheduling on semi-identical processors
• Scheduling Independent Tasks with Deadlines on Semi-identical Processors
• Scheduling jobs and maintenance activities on parallel machines

This page was built for publication: Minimizing the sum of job completion times on capacitated two-parallel machines