New exact method to solve the Pm/rj/SigmaCj schedule problem

This paper addresses a parallel machine scheduling problem (PMSP) with release dates to minimize sum of completion time. This problem presents numerous potential applications in real life. An efficient exact branch and bound method is developed using theoretical properties. By allowing job splitting...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of production economics Vol. 100; no. 1; p. 168
Main Authors:	Yalaoui, F, Chu, C
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier Sequoia S.A 01-03-2006
Subjects:	Branch & bound algorithms Job shops Production planning Scheduling Studies
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	This paper addresses a parallel machine scheduling problem (PMSP) with release dates to minimize sum of completion time. This problem presents numerous potential applications in real life. An efficient exact branch and bound method is developed using theoretical properties. By allowing job splitting or by relaxing release date constraints, a polynomial lower bounding scheme is proposed. The method was tested on more than 2000 randomly generated medium-sized instances. We have solved medium-sized instances in a reasonable amount of time. Our method is the first attempt to solve exactly the considered problem. It opens an interesting way in PMSP with sum of completion time criterion. [PUBLICATION ABSTRACT]
ISSN:	0925-5273 1873-7579