A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
From MaRDI portal
(Redirected from Publication:490356)
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
Cites work
- A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- A survey of scheduling problems with setup times or costs
- 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
- An iterative approach for the serial batching problem with parallel machines and job families
- Batch sizing and job sequencing on a single machine
- Flow-shop batch scheduling with identical processing-time jobs
- Heuristics and sequence-dependent set-up jobs in flow line cells
- Job lateness in flowshops with setup and removal times separated
- Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
- On the Complexity of Scheduling with Batch Setup Times
- One-machine batching and sequencing of multiple-type items
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
- Scheduling a two-stage hybrid flowshop with separable setup and removal times
- Scheduling with batching: A review
- 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.
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
Cited in
(8)- Flow shop batching and scheduling with sequence-dependent setup times
- Metaheuristics for solving a flexible flow-shop scheduling problem with s-batching machines
- An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
- Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry
- Parallel machine scheduling by family batching with sequence-independent set-up times
- A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
- An iterative approach for the serial batching problem with parallel machines and job families
- A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
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)
