Scheduling unrelated parallel machines with optional machines and jobs selection
From MaRDI portal
Publication:1762164
DOI10.1016/j.cor.2011.10.012zbMath1251.90141OpenAlexW1990154239MaRDI QIDQ1762164
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/35335
makespanunrelated parallel machinesjob selection\texttt{ILOG CPLEX 12.1.}not all jobsnot all machinesoptional machines
Related Items
Algorithms and implementation of a set partitioning approach for modular machining line design ⋮ A comparative study of solution representations for the unrelated machines environment ⋮ The optimal number of used machines in a two-stage flexible flowshop scheduling problem ⋮ Graph multi-coloring for a job scheduling application ⋮ Batch scheduling in a two-stage flexible flow shop problem ⋮ GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times ⋮ Exact methods for order acceptance and scheduling on unrelated parallel machines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A state-of-the-art review of parallel-machine scheduling research
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Minimizing the number of machines for scheduling jobs with equal processing times
- Minimizing the number of machines for minimum length schedules
- Survey of scheduling research involving due date determination decisions
- The hybrid flow shop scheduling problem
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Scheduling with Deadlines and Loss Functions
- Planning and Scheduling in Manufacturing and Services
- Parallel machine scheduling problems considering regular measures of performance and machine cost
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey