Greedy heuristics for identical parallel machine scheduling problem with single server to minimize the makespan
El Idrissi Abdelhak, Benbrahim Mohammed, Benmansour Rachid and 1 more
MATEC Web of Conferences · 2018
doi:10.1051/matecconf/201820000001 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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.
Abstract licence: CC BY
References13
13 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.