Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times

DOI10.1016/j.ejor.2008.03.043zbMath1176.90427OpenAlexW2058996863WikidataQ57185750 ScholiaQ57185750MaRDI QIDQ1042030

Racem Mellouli, Chérif Sadfi, Imed Kacem, Chengbin Chu

Publication date: 7 December 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.03.043

zbMATH Keywords

parallel machinesscheduling problemtotal completion timesavailability constraints

Mathematics Subject Classification ID

Mixed integer programming (90C11) Dynamic programming (90C39)

Related Items

Scheduling jobs and maintenance activities on parallel machines, Production-driven opportunistic maintenance for batch production based on MAM-APB scheduling, An ILS heuristic for the ship scheduling problem: application in the oil industry, The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach, 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, A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach, Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach, A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints, Two branch-and-bound algorithms for the robust parallel machine scheduling problem, Optimal solutions for a dock assignment problem with trailer transportation, A Survey on Approximation Algorithms for Scheduling with Machine Unavailability

Cites Work

• Single machine flow-time scheduling with scheduled maintenance
• Single machine flow-time scheduling with a single breakdown
• Capacitated two-parallel machines scheduling to minimize sum of job completion times
• Machine scheduling with availability constraints
• Minimizing the sum of job completion times on capacitated parallel machines
• Current trends in deterministic scheduling
• Preemptive scheduling with availability constraints to minimize total weighted completion times
• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
• Scheduling with limited machine availability
• Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
• Machine scheduling with an availability constraint
• Scheduling on semi-identical processors
• Scheduling independent tasks to reduce mean finishing time
• Scheduling jobs and maintenance activities on parallel machines
• Technical Note—Minimizing Average Flow Time with Parallel Machines
• Two-machine flow shops with limited machine availability