A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
DOI10.1007/S10951-013-0315-3zbMATH Open1305.90201OpenAlexW2083578364MaRDI QIDQ490356FDOQ490356
Udo Buscher, Lars Mönch, Liji Shen
Publication date: 22 January 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-013-0315-3
Recommendations
- An iterative approach for the serial batching problem with parallel machines and job families
- An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
- Parallel machine scheduling by family batching with sequence-independent set-up times
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- Scheduling parallel machines to minimize weighted flowtime with family set-up times
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Scheduling with batching: A review
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Variable neighborhood search
- A survey of scheduling problems with setup times or costs
- An iterative approach for the serial batching problem with parallel machines and job families
- Variable neighborhood search: Principles and applications
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
- The complexity of one-machine batching problems
- Total flowtime in no-wait flowshops with separated setup times.
- On the Complexity of Scheduling with Batch Setup Times
- Batch sizing and job sequencing on a single machine
- Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- Scheduling a two-stage hybrid flowshop with separable setup and removal times
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
- One-machine batching and sequencing of multiple-type items
- A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal
- Flow-shop batch scheduling with identical processing-time jobs
- Job lateness in flowshops with setup and removal times separated
- A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
- Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
- Heuristics and sequence-dependent set-up jobs in flow line cells
Cited In (3)
This page was built for publication: A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490356)
