Two-machine job shop problem for makespan minimization under availability constraint

被引：13

作者：

Benttaleb, Mourad ^{[1
]}

Hnaien, Faicel ^{[1
]}

Yalaoui, Farouk ^{[1
]}

机构：

[1] Univ Technol Troyes, ICD LOSI, UMR CNRS 6281, 12 Rue Marie Curie,CS 42060, F-10004 Troyes, France

来源：

IFAC PAPERSONLINE | 2016年 / 49卷 / 28期

关键词：

Job shop scheduling; Availability constraint; Preventive maintenance; Mixed Integer Programming; Branch and bound; LIMITED MACHINE AVAILABILITY; SCHEDULING PROBLEMS; FLOWSHOP;

D O I：

10.1016/j.ifacol.2016.11.023

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We treat a two-machine job shop scheduling problem with availability constraint on one machine to minimize the makespan. We consider the deterministic case where the unavailability period, corresponding to preventive maintenance tasks, is known in advance and fixed. We assume that jobs are non-preemptive. First, two mixed-integer programming (MIP) models are first presented. Some propositions concerning the optimality of Jacksons algorithm when availability constraint exists is provided. Then a branch and bound (B&B) method is developed to solve the problem. The obtained results prove the efficiency of the proposed B&B. (C) 2016, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

引用

页码：132 / 137

页数：6

共 18 条

[1]

Aggoune R., 2004, ICAPS, P253

[2]

Aggoune R., 2002, THESIS

[3] Disjunctive and time-indexed formulations for non-preemptive job shop scheduling with resource availability constraints [J].

Azem, S. ;

Aggoune, R. ;

Dauzere-Peres, S. .

2007 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4, 2007, :787-+

[4]

Azem S., 2010, THESIS

[5] A New Heuristic Method for Solving Joint Job Shop Scheduling of Production and Maintenance [J].

Fnaiech, N. ;

Fitouri, C. ;

Varnier, C. ;

Fnaiech, F. ;

Zerhouni, N. .

IFAC PAPERSONLINE, 2015, 48 (03) :1802-1808

[6] Makespan minimization on a two-machine flowshop with an availability constraint on the first machine [J].

Hnaien, Faicel ;

Yalaoui, Farouk ;

Mhadhbi, Ahmed .

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2015, 164 :95-104

[7]

Jackson J.R., 1956, Naval Research Logistics Quarterly, V3, P201, DOI DOI 10.1002/NAV.3800030307

[8]

Johnson S. M., 1954, NAVAL RES LOGISTICS, V1, P61, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110]

[9] Two-machine flowshop scheduling with availability constraints [J].

Lee, CY .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 114 (02) :420-429

[10] Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint [J].

Lee, CY .

OPERATIONS RESEARCH LETTERS, 1997, 20 (03) :129-139

← 1 2 →