✦ LIBER ✦

A modified artificial bee colony algorithm for order acceptance in two-machine flow shops

✍ Scribed by Wang, Xiuli; Xie, Xingzi; Cheng, T.C.E.

Book ID: 122784507
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 405 KB
Volume: 141
Category: Article
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2012.06.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Discrete Artificial Bee Colony Algorit

A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling

✍ DENG, Guanlong; XU, Zhenhao; GU, Xingsheng 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Modified artificial bee colony algorithm

Modified artificial bee colony algorithm based on fuzzy multi-objective technique for optimal power flow problem

✍ A. Khorsandi; S.H. Hosseinian; A. Ghazanfari 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 506 KB

Artificial bee colony algorithm for CONW

Artificial bee colony algorithm for CONWIP production control system in a multi-product multi-machine manufacturing environment

✍ Saeede Ajorlou, Issac Shams 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 289 KB

Genetic algorithms for minimizing makesp

Genetic algorithms for minimizing makespan in a flow shop with two capacitated batch processing machines

✍ Praveen Kumar Manjeshwar; Purushothaman Damodaran; Krishnaswami Srihari 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 258 KB

Rescheduling strategies for integrating

Rescheduling strategies for integrating rush orders with preventive maintenance in a two-machine flow shop

✍ Chiu, Yufang; Shih, Ching-Ju 📂 Article 📅 2012 🏛 Taylor and Francis Group 🌐 English ⚖ 365 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.