loading
Documents

Research.Publish.Connect.

Paper

Authors: Fatma Hermès 1 and Khaled Ghédira 2

Affiliations: 1 High Institute of Computer Sciences (ISI) and Tunis El Manar University, Tunisia ; 2 High Institute of Management (ISG) and Tunis University, Tunisia

ISBN: 978-989-758-263-9

Keyword(s): Scheduling, Identical Parallel Machines, Non-idling Constraint, Release Dates, Delivery Times, Makespan.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Evolutionary Computation and Control ; Formal Methods ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Optimization Algorithms ; Planning and Scheduling ; Simulation and Modeling ; Symbolic Systems

Abstract: This paper considers the problem of scheduling jobs with release dates and delivery times on 􀝉 identical machines where the machines must work under the non-idling constraint. Indeed, each machine must process all the jobs affected to it continuously without any intermediate delays. The objective is to minimize the makespan. This problem is strongly NP-hard since its particular case on only one machine has been proved to be strongly NP-hard (Chrétienne, 2008). Furthermore, the complexity of the considered problem where the jobs are unit-time remains an open question (Chrétienne, 2014). Recently, the particular case on only one non-idling machine has been studied and some efficient classical algorithms proposed to solve the classic one machine scheduling problem (i.e without adding the non-idling constraint) have been easily extended to solve its non-idling version (see (Chrétienne, 2008), (Carlier et al., 2010) and (Kacem and kellerer, 2014)). In this paper, we propose some heuristics to solve the considered 􀝉 machines problem under the non-idling constraint. We first suggest a generalization of the well known rule of Jackson (Jackson, 1955) in order to construct feasible schedules. This rule gives priority to the ready jobs with the greatest delivery time. Then, we extend Potts algorithm (Potts, 1980) which has been proposed to solve the one machine problem. Finally, we present the results of a computational study which shows that the proposed heuristics are fast and yields in most tests schedules with relative deviation which is on average equal to 0,4%. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.81.220.239

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Hermès, F. and Ghédira, K. (2017). Scheduling Jobs with Releases Dates and Delivery Times on M Identical Non-idling Machines.In Proceedings of the 14th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-758-263-9, pages 82-91. DOI: 10.5220/0006428100820091

@conference{icinco17,
author={Fatma Hermès. and Khaled Ghédira.},
title={Scheduling Jobs with Releases Dates and Delivery Times on M Identical Non-idling Machines},
booktitle={Proceedings of the 14th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2017},
pages={82-91},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006428100820091},
isbn={978-989-758-263-9},
}

TY - CONF

JO - Proceedings of the 14th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - Scheduling Jobs with Releases Dates and Delivery Times on M Identical Non-idling Machines
SN - 978-989-758-263-9
AU - Hermès, F.
AU - Ghédira, K.
PY - 2017
SP - 82
EP - 91
DO - 10.5220/0006428100820091

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.