Mathematical aspects of the 3 × n job-shop sequencing problem

DOI10.1002/NAV.3800210110MaRDI QIDQ4775690zbMATH OpenOpenAlexFDO

Authors Wlodzimierz Szwarc

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.3800210110

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Cites work

• On some sequencing problems

Cited in

(8)

• On three-machine flow shops with random job processing times
• Elimination conditions and lower bounds for the permutation flow-shop sequencing problem
• A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
• Optimal Algorithms for Job-Blocks in 2 × n Sequencing Problem with Transportation Times—A Computational Comparison
• Non-bottleneck machines in three-machine flow shops
• A computational study of the permutation flow shop problem based on a tight lower bound
• Sequency on two and three machines with setup, processing and removal times separated
• An improved NEH heuristic to minimize makespan in permutation flow shops

This page was built for publication: Mathematical aspects of the 3 × n job-shop sequencing problem

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