A sequencing problem in the weaving industry

DOI10.1016/0377-2217(93)90206-3zbMath0766.90036OpenAlexW1981403497MaRDI QIDQ1207057

Mohamad H. Al-Haboubi, Shokri Z. Selim

Publication date: 3 May 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90206-3

zbMATH Keywords

shortest pathsequencingtravelling salesmanpolynomial time solution algorithmset-up costs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Setup coordination between two stages of a production system: a multi-objective evolutionary approach ⋮ A bi-objective coordination setup problem in a two-stage production system ⋮ Low-complexity algorithms for sequencing jobs with a fixed number of job-classes

Cites Work

• Unnamed Item
• Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
• On general routing problems