loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Fatma Hermès 1 ; Jacques Carlier 2 ; Aziz Moukrim 2 and Khaled Ghédira 3

Affiliations: 1 Faculté des Sciences Mathématiques, Physiques et Naturelles de Tunis, Tunisia ; 2 Université de Technologie de Compiègne, France ; 3 Université de Tunis, Tunisia

ISBN: 978-989-8111-99-9

Keyword(s): Scheduling, Job Shop, Two Machines, No-idle Constraint, Makespan, Optimal Solution.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; 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 deals with two-machine job shop scheduling problems working under the no-idle constraint, that is, machines must work continuously without idle intervals. The makespan (Cmax) has to be minimized. First, we study the problem where each job consists of at most two operations and we show that it can be solved polynomially using Jackson’s rule (Jackson, 1956). Second, we study the problem where the number of operations per job can be greater than two and all operations are of unit time and we extend the results of (Hefetz and Adiri, 1982). Finally, we discuss the possibility of getting feasible solutions and then optimal solutions in the general case where the number of operations per job can be greater than two and all operations do not have the same processing time.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

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 100.25.43.188

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.; Carlier J.; Moukrim A.; Ghédira K. and (2009). MINIMIZING THE MAKESPAN IN TWO-MACHINE JOB SHOP SCHEDULING PROBLEMS WITH NO MACHINE IDLE-TIME.In Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO, ISBN 978-989-8111-99-9, pages 89-96. DOI: 10.5220/0002213500890096

@conference{icinco09,
author={Fatma Hermès and Jacques Carlier and Aziz Moukrim and Khaled Ghédira},
title={MINIMIZING THE MAKESPAN IN TWO-MACHINE JOB SHOP SCHEDULING PROBLEMS WITH NO MACHINE IDLE-TIME},
booktitle={Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO,},
year={2009},
pages={89-96},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002213500890096},
isbn={978-989-8111-99-9},
}

TY - CONF

JO - Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO,
TI - MINIMIZING THE MAKESPAN IN TWO-MACHINE JOB SHOP SCHEDULING PROBLEMS WITH NO MACHINE IDLE-TIME
SN - 978-989-8111-99-9
AU - Hermès, F.
AU - Carlier, J.
AU - Moukrim, A.
AU - Ghédira, K.
PY - 2009
SP - 89
EP - 96
DO - 10.5220/0002213500890096

Login or register to post comments.

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