Flowshop scheduling with identical jobs and uniform parallel machines
From MaRDI portal
Publication:1303728
DOI10.1016/S0377-2217(97)00194-XzbMath0936.90022OpenAlexW2088861577MaRDI QIDQ1303728
Sushil Verma, Mohamed I. Dessouky, Maged M. Dessouky
Publication date: 16 September 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00194-x
Related Items
A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines ⋮ Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory ⋮ Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization ⋮ Online algorithms for scheduling with machine activation cost on two uniform machines ⋮ Flexibility in Biopharmaceutical Manufacturing Using Particle Swarm Algorithms and Genetic Algorithms ⋮ Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage ⋮ The hybrid flow shop scheduling problem ⋮ Scheduling jobs on a \(k\)-stage flexible flow-shop ⋮ A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time ⋮ Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines ⋮ Flowshop scheduling with identical jobs and uniform parallel machines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A state-of-the-art review of parallel-machine scheduling research
- Flowshop scheduling with identical jobs and uniform parallel machines
- Scheduling a two-stage hybrid flowshop with separable setup and removal times
- Minimizing makespan in hybrid flowshops
- Scheduling identical jobs on uniform parallel machines
- Two-Stage, Hybrid Flowshop Scheduling Problem
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time