A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
From MaRDI portal
Publication:1743651
DOI10.1007/s10951-017-0530-4zbMath1392.90068OpenAlexW2626058839MaRDI QIDQ1743651
John W. Fowler, Yi Tan, Lars Mönch
Publication date: 13 April 2018
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-017-0530-4
decompositioncomputational experimentsbatchingvariable neighborhood searchtwo-stage flexible flow shop
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Parallel batching with multi-size jobs and incompatible job families, Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date, Preface, Scheduling a proportionate flow shop of batching machines, A survey of scheduling with parallel batch (p-batch) processing, Online algorithms to schedule a proportionate flexible flow shop of batching machines
Cites Work
- An iterative approach for the serial batching problem with parallel machines and job families
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem
- Heuristics for minimizing total weighted tardiness in flexible flow shops
- Decomposition methods for reentrant flow shops with sequence-dependent setup times
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- Minimizing due date related performance measures on two batch processing machines
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
- The hybrid flow shop scheduling problem
- Improved MILP models for two-machine flowshop with batch processing machines
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- A computational study of shifting bottleneck procedures for shop scheduling problems
- Applying machine based decomposition in 2-machine flow shops
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The use of upstream and downstream information in scheduling semiconductor batch operations
- Bottleneck-focused scheduling for a hybrid flowshop
- Variable neighborhood search: Principles and applications
- Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
