Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach

DOI10.1002/NAV.3800210311MaRDI QIDQ4041331zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Hamilton-Jacobi theories (49L99) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cites work

• Dynamic Programming Treatment of the Travelling Salesman Problem
• scientific article; zbMATH DE number 3174053 (Why is no real title available?)

Cited in

(15)

• The two-machine sequence dependent flowshop scheduling problem
• A sequencing problem in the weaving industry
• Heuristics for the flow line problem with setup costs
• 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
• Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
• 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
• Flowshop scheduling research after five decades
• Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
• Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup
• scientific article; zbMATH DE number 1389747 (Why is no real title available?)
• Flowshop-scheduling problems with makespan criterion: a review
• Traveling salesman problem with backend information processing

This page was built for publication: Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4041331)