A mixed integer linear programming modelling for the flexible cyclic jobshop problem

This paper addresses the Cyclic Jobshop Problem in a flexible context. The flexibility feature means that machines are able to perform several kinds of tasks. Hence, a solution of the scheduling problem does not only concern the starting times of the elementary tasks, but also the assignment of thes...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research 2020-02, Vol.285 (1-2), p.335-352
Main Authors: Quinton, Félix, Hamaz, Idir, Houssin, Laurent
Format: Article
Language:English
Subjects:
Benders decomposition
Business and Management
Combinatorics
Computer Science
Cycle time
Flexible assembly systems
Flexible manufacturing systems
Heuristic methods
Integer programming
Linear programming
Methods
Mixed integer
Operations Research
Operations Research/Decision Theory
Production scheduling
S.I.: Project Management and Scheduling 2018
Schedules
Scheduling (Management)
Task scheduling
Theory of Computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper addresses the Cyclic Jobshop Problem in a flexible context. The flexibility feature means that machines are able to perform several kinds of tasks. Hence, a solution of the scheduling problem does not only concern the starting times of the elementary tasks, but also the assignment of these tasks to a unique machine. The objective considered in this paper is the minimisation of the cycle time of a periodic schedule. We formulate the problem as a Mixed Integer Linear Problem and propose a Benders decomposition method along with a heuristic procedure to speed up the solving of large instances. It consists in reducing the number of machines available for each task. Results of numerical experiments on randomly generated instances show that the MILP modelling has trouble solving difficult instances, while our decomposition method is more efficient for solving such instances. Our heuristic procedure provides good estimates for difficult instances.
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-019-03387-9