Parallel Machine Scheduling: Impact of Adding Extra Machines
DOI10.1287/OPRE.2013.1208zbMATH Open1291.90100OpenAlexW2138572387MaRDI QIDQ5166278FDOQ5166278
Authors: Kabir Rustogi, V. A. Strusevich 
Publication date: 26 June 2014
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2013.1208
Recommendations
- Parallel machine scheduling with high multiplicity
- An improved algorithm for parallel machine scheduling under additional resource constraints
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Parallel machine scheduling with speed-up resources
- Approximation of the parallel machine scheduling problem with additional unit resources
- Parallel machine scheduling with preference of machines
- Scheduling problem with multi-purpose parallel machines
- Parallel machine scheduling with special jobs
- Parallel machine scheduling with additional resources: a Lagrangian-based constraint programming approach
- Parallel machine scheduling with time dependent processing times
production/scheduling: approximations/heuristicproduction/scheduling: sequencing: deterministic: multiple machine
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cited In (15)
- Uniform parallel machine scheduling problems with fixed machine cost
- Parametric analysis of the quality of single preemption schedules on three uniform parallel machines
- A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
- Unrelated Parallel Machine Scheduling with Job Splitting, Setup Time, Learning Effect, Processing Cost and Machine Eligibility
- Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job
- Preemptive and non-preemptive scheduling on two unrelated parallel machines
- Minimization of maximum lateness on parallel machines with a single server and job release dates
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling
- Analysis of flow shop scheduling anomalies
- Schedules with a single preemption on uniform parallel machines
- Identical parallel machine scheduling problem with release dates and the change of the number of machines
- On the minimum number of resources for a perfect schedule
- Power of preemption for minimizing total completion time on uniform parallel machines
- Bi-objective scheduling on uniform parallel machines considering electricity cost
This page was built for publication: Parallel Machine Scheduling: Impact of Adding Extra Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166278)
