✦ LIBER ✦

An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problem

✍ Scribed by Seidgar, Hany; Kiani, Morteza; Abedi, Mehdi; Fazlollahtabar, Hamed

Book ID: 121418122
Publisher: Taylor and Francis Group
Year: 2013
Tongue: English
Weight: 724 KB
Volume: 52
Category: Article
ISSN: 0020-7543
DOI: 10.1080/00207543.2013.848490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Evolutionary heuristics and an algorithm

Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times

✍ Allahverdi, Ali; Al-Anzi, Fawaz S. 📂 Article 📅 2006 🏛 Taylor and Francis Group 🌐 English ⚖ 193 KB

An exact algorithm for the batch sequenc

An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer

✍ A. Agnetis; F. Rossi; G. Gristina 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB 👁 2 views

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively.

Application of an effective modified gra

Application of an effective modified gravitational search algorithm for the coordinated scheduling problem in a two-stage supply chain

✍ Jun Pei,Xinbao Liu,Panos M. Pardalos… 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 679 KB