Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
From MaRDI portal
Publication:4041331
DOI10.1002/nav.3800210311zbMath0289.90026OpenAlexW1993788738MaRDI QIDQ4041331
Burton D. Corwin, Augustine O. Esogbue
Publication date: 1974
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800210311
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Hamilton-Jacobi theories (49L99)
Related Items
The two-machine sequence dependent flowshop scheduling problem ⋮ Unnamed Item ⋮ An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal ⋮ Scheduling in a sequence dependent setup environment with genetic search ⋮ Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times. ⋮ A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives ⋮ A sequencing problem in the weaving industry ⋮ Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics ⋮ 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 ⋮ Flowshop scheduling research after five decades ⋮ Heuristics for the flow line problem with setup costs
Cites Work
