Modeling the parallel machine scheduling problem with step deteriorating jobs

DOI10.1016/J.EJOR.2016.04.010MaRDI QIDQ323474zbMATH OpenOpenAlexWikidataFDO

Authors Eduardo Lalla-Ruiz, Stefan Voß

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

zbMATH Keywords

mathematical programmingmachine schedulingparallel machine scheduling with step deteriorating jobsset-partitioning formulationsstep deterioration

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 1302177 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• A concise survey of scheduling with time-dependent processing times
• A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
• A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration
• A state-of-the-art review of parallel-machine scheduling research
• Batch scheduling with step-deteriorating processing times to minimize flowtime
• Batching in single operation manufacturing systems
• Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs
• Exploiting erraticism in search
• Makespan minimization in single-machine scheduling with step-deterioration of processing times
• Mathematical programming formulations for machine scheduling: A survey
• Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
• Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
• Scheduling. Theory, algorithms, and systems.
• Set Partitioning: A survey
• Single machine scheduling with start time dependent processing times: Some solvable cases
• Single machine scheduling with step-deteriorating processing times
• Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs

Cited in

(8)

• 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
• Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
• Coordination mechanisms for scheduling games with proportional deterioration

Describes a project that uses

Uses Software

• MIPLIB

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)