MATEC Web Conf.
Volume 200, 2018International Workshop on Transportation and Supply Chain Engineering (IWTSCE’18)
|Number of page(s)||7|
|Published online||14 September 2018|
Greedy heuristics for identical parallel machine scheduling problem with single server to minimize the makespan
Laboratory MASI, Research team MOAD6, Ecole Mohammadia d’Ingénieurs, Rabat, Morocco
2 Laboratory SI2M, Institut National de Statistique et d’Economie Appliquée , Rabat, Morocco
3 LAMIH UMR CNRS 8201, Université de Valenciennes et du Hainaut Cambrésis, Valenciennes, France
* e-mail: email@example.com
This paper considers the problem of scheduling a set of n independent jobs on m identical parallel machines with setup times constraints. Immediately before processing, each job must be loaded on a common server to perform the setup operation. During the loading operation, both the machine and the server are occupied. Two greedy heuristics are developed for (m ≥ 2) in order to minimize respectively the server waiting time and the machine idle time. These heuristics generalize those proposed in the literature for the case of two machines. The computational results show the efficiency of the proposed heuristics.
© The Authors, published by EDP Sciences, 2018
This is an open access article distributed under the terms of the Creative Commons Attribution License 4.0 (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.