Scheduling job families on non-identical parallel machines with time constraints

DOI10.1007/s10479-012-1107-4zbMath1296.90055OpenAlexW2060691397MaRDI QIDQ744650

Ali Obeid, Claude Yugma, Stéphane Dauzère-Pérès

Publication date: 26 September 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1107-4

zbMATH Keywords

heuristicsschedulingparallel machinesmixed integer linear programmingtime constraintsemiconductor manufacturing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types ⋮ Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times ⋮ Optimizing multiple qualifications of products on non-identical parallel machines ⋮ Dispatching strategies for managing uncertainties in automated manufacturing systems ⋮ Unrelated parallel machine scheduling with new criteria: complexity and models ⋮ An improved decision support model for scheduling production in an engineer-to-order manufacturer ⋮ Bounds for parallel machine scheduling with predefined parts of jobs and setup time ⋮ Parallel machine scheduling with time constraints on machine qualifications ⋮ Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry ⋮ Integration of scheduling and advanced process control in semiconductor manufacturing: review and outlook

Cites Work

• The complexity of scheduling job families about a common due date
• Re-entrant lines
• Scheduling jobs on parallel machines to minimize a regular step total cost function
• Single-machine scheduling with advanced process control constraints
• Mean Flow Time Minimization in Reentrant Job Shops with a Hub

This page was built for publication: Scheduling job families on non-identical parallel machines with time constraints