Improved MILP models for two-machine flowshop with batch processing machines

被引：27

作者：

Liao, Ching-Jong ^{[1
]}

Liao, Li-Man ^{[2
]}

机构：

[1] Natl Taiwan Univ Sci & Technol, Dept Ind Management, Taipei 106, Taiwan

[2] Natl Chin Yi Univ Technol, Dept Ind Engn & Management, Taichung, Taiwan

来源：

MATHEMATICAL AND COMPUTER MODELLING | 2008年 / 48卷 / 7-8期

关键词：

batch processing; scheduling; flow shop; mathematical formulation;

D O I：

10.1016/j.mcm.2008.01.001

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper, we consider the problem of scheduling jobs in a flowshop with two batch processing machines such that the makespan is minimized. Batch processing machines are frequently encountered in many industrial environments such as heat treatment operations in a steel foundry and chemical processes performed in tanks or kilns. Improved Mixed Integer Linear Programming (MILP) models are presented for the flowshop problem with unlimited or zero intermediate storage. An MILP-based heuristic is also developed for the problem. Computational experiments show that the new MILP models can significantly improve the original ones. Also, the heuristic can obtain the optimal solutions for all the test problem instances. (C) 2008 Elsevier Ltd. All rights reserved.

引用

页码：1254 / 1264

页数：11

共 50 条

[41] Two-machine flowshop scheduling with availability constraints
Lee, CY
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 114 (02) : 420 - 429
[42] Two-machine flowshop dynamic scheduling problem
Chou, Fuh-Der
Lee, Ching-En
Kung Yeh Kung Chieng Hsueh K'an/Journal of the Chinese Institute of Industrial Engineers, 1998, 15 (04): : 315 - 324
[43] Minimising maximum lateness in a two-machine flowshop
Haouari, M
Ladhari, T
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2000, 51 (09) : 1100 - 1106
[44] Heuristic algorithms for the two-machine flowshop with limited machine availability
Blazewicz, J
Breit, J
Formanowicz, P
Kubiak, W
Schmidt, G
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2001, 29 (06): : 599 - 608
[45] Scheduling of a two-machine flowshop with availability constraints on the first machine
Allaoui, H
Artiba, A
Elmaghraby, SE
Riane, F
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 99 (1-2) : 16 - 27
[46] Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
Allahverdi, Ali
Aydilek, Harun
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (21) : 6367 - 6385
[47] Heuristic for scheduling in a two-machine bicriteria dynamic flowshop with setup and processing times separated
Su, LH
Chou, FD
PRODUCTION PLANNING & CONTROL, 2000, 11 (08) : 806 - 819
[48] Algorithms for a two-machine flowshop problem with jobs of two classes
Jeong, BongJoo
Kim, Yeong-Dae
Shim, Sang-Oh
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2020, 27 (06) : 3123 - 3143
[49] Two-machine flowshop scheduling in a physical examination center
Wang, Yadong
Fan, Baoqiang
Zhai, Jingang
Xiong, Wei
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (01) : 363 - 374
[50] Bicriteria Two-Machine Flowshop Scheduling using Metaheuristics
Mansouri, S. Afshin
Hendizadeh, S. Hamed
Salmasi, Nasser
GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2007, : 909 - 909

← 1 2 3 4 5 →