Rescheduling of identical parallel machines under machine eligibility constraints.

DOI10.1016/S0377-2217(02)00499-XzbMath1033.90031OpenAlexW2028606317MaRDI QIDQ1399598

Oguzhan Alagoz, Azizoglu, Meral

Publication date: 30 July 2003

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00499-x

zbMATH Keywords

parallel machinesSchedulingreschedulingeligibility constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (12)

The construction of stable project baseline schedules ⋮ Executing production schedules in the face of uncertainties: a review and some future directions ⋮ A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server ⋮ Scheduling parallel CNC machines with time/cost trade-off considerations ⋮ Predictive-reactive strategy for identical parallel machine rescheduling ⋮ MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints ⋮ Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption ⋮ Schedule-allocate and robust sequencing in three-machine robotic cell under breakdowns ⋮ An approach to predictive-reactive scheduling of parallel machines subject to disruptions ⋮ A two-stage solution approach for plastic injection machines scheduling problem ⋮ Project scheduling under uncertainty: survey and research potentials ⋮ Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption

Cites Work

• Unnamed Item
• One-machine rescheduling heuristics with efficiency and stability as criteria
• Capacitated two-parallel machines scheduling to minimize sum of job completion times
• Rescheduling on a single machine with part-type dependent setup times and deadlines
• Match-up scheduling under a machine breakdown
• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• On scheduling with ready-times, due-dates and vacations

This page was built for publication: Rescheduling of identical parallel machines under machine eligibility constraints.