An anticipative scheduling approach with controllable processing times
From MaRDI portal
Publication:2654388
DOI10.1016/j.cor.2009.09.001zbMath1178.90152OpenAlexW2078793748MaRDI QIDQ2654388
Ersin Körpeoğlu, Sinan Gürel, M. Selim Akturk
Publication date: 15 January 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/22304
Related Items
Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ Batch scheduling of identical jobs with controllable processing times ⋮ A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling ⋮ Predictive-reactive strategy for identical parallel machine rescheduling ⋮ Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
Cites Work
- Single machine flow-time scheduling with scheduled maintenance
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Scheduling for stability in single-machine production systems
- Parallel machine match-up scheduling with manufacturing cost considerations
- Single machine flow-time scheduling with a single breakdown
- Match-up scheduling under a machine breakdown
- Executing production schedules in the face of uncertainties: a review and some future directions
- Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach
- A survey of scheduling with controllable processing times
- Predictive-reactive scheduling on a single resource with uncertain future jobs
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
