The two-machine sequence dependent flowshop scheduling problem
From MaRDI portal
Publication:1081528
DOI10.1016/0377-2217(86)90037-8zbMath0601.90075OpenAlexW2062419055MaRDI QIDQ1081528
Jatinder N. D. Gupta, William P. Darrow
Publication date: 1986
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(86)90037-8
makespanapproximate algorithmsoptimality of a permutation schedulestatic two-machine flowshop scheduling
Related Items
Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups ⋮ An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal ⋮ Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates ⋮ Scheduling in a sequence dependent setup environment with genetic search ⋮ An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times ⋮ Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption ⋮ A comprehensive review of flowshop group scheduling literature ⋮ Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ Two-stage no-wait scheduling models with setup and removal times separated ⋮ Two-machine flow shop problems with a single server ⋮ Solving the serial batching problem in job shop manufacturing systems ⋮ An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem ⋮ Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times ⋮ Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. ⋮ A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ Flow shop batching and scheduling with sequence-dependent setup times ⋮ An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives ⋮ An approximate solution of the flow-shop problem with sequence dependent setup times ⋮ Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics ⋮ Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times ⋮ Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process ⋮ Heuristic methods and applications: A categorized survey ⋮ Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups ⋮ Scheduling a flowline manufacturing cell with sequence dependent family setup times ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints ⋮ Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Heuristics for the flow line problem with setup costs
Cites Work
- Optimal two- and three-stage production schedules with setup times included
- Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
- `` Strong NP-Completeness Results
- Heuristic-Programming Solution of a Flowshop-Scheduling Problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- Unnamed Item
- Unnamed Item
