A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time
From MaRDI portal
Publication:5059324
Recommendations
- A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE
- Two-Stage, Hybrid Flowshop Scheduling Problem
- A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- Group scheduling in a two-stage flowshop
Cites work
- A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
- A cyclical search for the two machine flow shop and open shop to minimise finishing time
- A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
- A review of metrics on permutations for search landscape analysis
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Computing with membranes
- DE-VNS: self-adaptive differential evolution with crossover neighborhood search for continuous global optimization
- Dynamic production control in a serial line with process queue time constraint
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- Outsourcing and scheduling for a two-machine flow shop with release times
- Scheduling batch processing machines with incompatible job families
- Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
- Scheduling with batching: A review
- Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
- Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine
- The Batch Loading and Scheduling Problem
- Two-stage assembly scheduling problem for minimizing total tardiness with setup times
- Variable Neighborhood Search
- Variable neighbourhood search: methods and applications
Cited in
(5)- A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints
- Two job cyclic scheduling with incompatibility constraints
- scientific article; zbMATH DE number 2086446 (Why is no real title available?)
- Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing
- Two-phase optimal and heuristic algorithms for flow shop scheduling with reworks under overlapped queue time limits
This page was built for publication: A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5059324)
