A sequencing problem in the weaving industry

DOI10.1016/0377-2217(93)90206-3MaRDI QIDQ1207057zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4079154
• scientific article; zbMATH DE number 4123514
• Production scheduling problems in a textile industry
• scientific article; zbMATH DE number 3850790
• Single facility sequencing with variable processing times and costs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On general routing problems
• Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach

Cited in

(5)

• A bi-objective coordination setup problem in a two-stage production system
• An efficient optimal solution to the coil sequencing problem in electro-galvanizing line
• Setup coordination between two stages of a production system: a multi-objective evolutionary approach
• Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
• Sequence knitting

This page was built for publication: A sequencing problem in the weaving industry

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