An algorithm of shortening idle time for the assembly problem

MaRDI QIDQ3500832zbMATH OpenFDO

Authors Zhiqiang Xie, Qiushan Liu, Jing Cong, Guangyu Tan

Publication date 3 June 2008

zbMATH Keywords

idle timecritical pathassembly problemsindependent operation

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• scientific article; zbMATH DE number 4059101
• Assembly-line scheduling with concurrent operations and parallel machines
• Machine-driven integrated scheduling algorithm with equipment idle adjustment
• An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
• Assembly flowshop scheduling problem: speed-up procedure and computational evaluation

Cited in

(1)

• Machine-driven integrated scheduling algorithm with equipment idle adjustment

This page was built for publication: An algorithm of shortening idle time for the assembly problem

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