Modeling the parallel machine scheduling problem with step deteriorating jobs
DOI10.1016/J.EJOR.2016.04.010zbMATH Open1346.90787OpenAlexW2340799592WikidataQ57866727 ScholiaQ57866727MaRDI QIDQ323474FDOQ323474
Stefan Voß, Eduardo Lalla-Ruiz
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.04.010
Recommendations
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
- Single machine scheduling with step-deteriorating processing times
- Scheduling with step-deteriorating jobs to minimize the makespan
- Parallel machine scheduling problems with proportionally deteriorating jobs
- Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects
mathematical programmingmachine schedulingparallel machine scheduling with step deteriorating jobsset-partitioning formulationsstep deterioration
Cites Work
- Title not available (Why is that?)
- Exploiting Erraticism in Search
- Scheduling
- A state-of-the-art review of parallel-machine scheduling research
- Batching in single operation manufacturing systems
- Mathematical programming formulations for machine scheduling: A survey
- Set Partitioning: A survey
- Single machine scheduling with start time dependent processing times: Some solvable cases
- A concise survey of scheduling with time-dependent processing times
- Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
- Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
- Batch scheduling with step-deteriorating processing times to minimize flowtime
- Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs
- Title not available (Why is that?)
- Makespan minimization in single-machine scheduling with step-deterioration of processing times
- Single machine scheduling with step-deteriorating processing times
- A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration
Cited In (7)
- Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times
- Parallel-Machine Scheduling with Step-Deteriorating Jobs to Minimize the Total (Weighted) Completion Time
- Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times
- Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events
- Patient scheduling with deteriorating treatment duration and maintenance activity
- The matching relaxation for a class of generalized set partitioning problems
- Coordination mechanisms for scheduling games with proportional deterioration
Uses Software
This page was built for publication: Modeling the parallel machine scheduling problem with step deteriorating jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323474)
