scientific article

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(198710)34:5<619::AID-NAV3220340503>3.0.CO;2-B" /><619::AID-NAV3220340503>3.0.CO;2-B 10.1002/1520-6750(198710)34:5<619::AID-NAV3220340503>3.0.CO;2-BzbMath0657.90046MaRDI QIDQ3806968

Wlodzimierz Szwarc, Jatinder N. D. Gupta

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Computational experienceflow-shop schedulingminimum makespan permutation schedulepolynomially bounded approximate methodsequence-dependent additive setup timestwo-machine case

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (12)

Scheduling a two-stage hybrid flowshop with separable setup and removal times ⋮ An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal ⋮ An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times ⋮ An approximate solution of the flow-shop problem with sequence dependent setup times ⋮ Scheduling under machine breakdown in a continuous process industry ⋮ A new heuristic and dominance relations for no-wait flowshops with setups ⋮ Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process ⋮ A hybrid two-stage flowshop with part family, batch production, major and minor set-ups ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Heuristics for the flow line problem with setup costs

This page was built for publication: