Scheduling under a common due-data on parallel unrelated machines

✍ Scribed by George I. Adamopoulos; Costas P. Pappis

• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 486 KB
• Volume: 105
• Category: Article
• ISSN: 0377-2217
• DOI: 10.1016/s0377-2217(97)00057-x

✦ Synopsis

Due-date determination problems have gained significant attention in recent years due to the industrial focus in the just-in-time philosophy. In this paper the problem of scheduling a set of independent jobs on parallel unrelated processors under a common due-date is examined. The common due-date is a decision variable. The objective is to allocate and 9 ,," , sequence the jobs on the machines and to determine the optimal due-date, so that the total cost be mmlmtsed. This cost is composed of the due-date assignment, the total earliness and the total tardiness cost. As the problem is NP-hard, a polynomial time heuristic procedure, which provides efficient solutions, is developed. The procedure is illustrated by means of an example and is tested via two small size experiments 9 9 1998 Elsevier Science B.V.