Parallel machine match-up scheduling with manufacturing cost considerations

DOI10.1007/S10951-009-0111-2zbMath1185.90064OpenAlexW2157512473MaRDI QIDQ969751

Sinan Gürel, M. Selim Akturk, Atamtürk, Alper

Publication date: 7 May 2010

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-009-0111-2

zbMATH Keywords

second-order cone programmingcontrollable processing timesmatch up timesparallel machine rescheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (11)

Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance ⋮ An analysis of the non-preemptive mixed-criticality match-up scheduling problem ⋮ An anticipative scheduling approach with controllable processing times ⋮ Aircraft Rescheduling with Cruise Speed Control ⋮ Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ Lifted polymatroid inequalities for mean-risk optimization with indicator variables ⋮ On the convex hull of convex quadratic optimization problems with indicators ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ The job shop scheduling problem with convex costs ⋮ Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model

Cites Work

• A strong conic quadratic reformulation for machine-job assignment with controllable processing times
• A robust approach for the single machine scheduling problem
• Scheduling for stability in single-machine production systems
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
• Second-order cone programming
• Match-up scheduling under a machine breakdown
• Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach
• A survey of scheduling with controllable processing times
• Rescheduling manufacturing systems: A framework of strategies, policies, and methods
• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
• Lectures on Modern Convex Optimization
• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• The Nonlinear Resource Allocation Problem

This page was built for publication: Parallel machine match-up scheduling with manufacturing cost considerations