Modeling and Solving Scheduling Problem with m Uniform Parallel Machines Subject to Unavailability Constraints

The problem investigated in this paper is scheduling on uniform parallel machines, taking into account that machines can be periodically unavailable during the planning horizon. The objective is to determine planning for job processing so that the makespan is minimal. The problem is known to be NP-h...

Full description

Bibliographic Details

Published in:	Algorithms Vol. 12; no. 12; p. 247
Main Author:	Kaabi, Jihene
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.12.2019
Subjects:	Algorithms Job shops Linear programming makespan Mathematical models optimal algorithm Preventive maintenance quadratic programming Schedules Scheduling unavailability constraints uniform parallel machines
ISSN:	1999-4893, 1999-4893
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!