Minimizing the sum of job completion times on capacitated parallel machines
From MaRDI portal
Publication:1339850
DOI10.1016/0895-7177(94)90024-8zbMath0810.90072OpenAlexW2036466874MaRDI QIDQ1339850
Publication date: 2 April 1995
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(94)90024-8
NP-hardefficient heuristicparallel identical machinessum of job completion timescapacitated parallel machines
Related Items
Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs ⋮ Unnamed Item ⋮ Makespan minimization for two parallel machines with an availability constraint ⋮ Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint ⋮ Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures ⋮ Scheduling with limited machine availability ⋮ Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times ⋮ Single-machine scheduling with maintenance in a manufacturing system ⋮ SINGLE MACHINE SCHEDULING WITH LINEAR DETERIORATING JOBS UNDER PREDICTIVE DISRUPTION ⋮ Parallel machines scheduling with deteriorating jobs and availability constraints ⋮ Single-machine scheduling with maintenance and repair rate-modifying activities ⋮ Minimizing the sum of job completion times on capacitated two-parallel machines ⋮ Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times ⋮ Machine scheduling with an availability constraint ⋮ Two-machine flowshop scheduling with availability constraints ⋮ A new tabu search procedure for an audit-scheduling problem ⋮ Machine scheduling with a rate-modifying activity ⋮ Single-machine scheduling with periodic maintenance and nonresumable jobs.
Cites Work
