Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach

OMAR, M and TEO, S (2006) Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach. Applied Mathematics and Computation, 181 (2). pp. 1008-1017. ISSN 00963003

[img] Text (Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach)
1301.pdf
Restricted to Repository staff only

Download (0B)
Official URL: http://dx.doi.org/10.1016/j.amc.2006.01.068

Abstract

This research considers the problem of scheduling jobs on a set of identical parallel machines, with distinct due dates, process time and early due date restrictions. Further more, the jobs originate from incompatible product families, making it a sequence-dependent setup every time a job is switched from one family to another. Based on the policy that discourages both jobs being early as well as late, we focus on minimizing the sum of earliness/tardiness in the presence of setups. We developed a mixed integer programming formulation model to deal with such scheduling problems. The model can provide optimal solutions for up to 18 jobs that originate from up to four incompatible families. (c) 2006 Elsevier Inc. All rights reserved.

Item Type: Article
Subjects: T Technology > T Technology (General)
Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Engineering and Technology (FET)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 13 Oct 2011 06:49
Last Modified: 03 Mar 2014 04:45
URI: http://shdl.mmu.edu.my/id/eprint/3246

Actions (login required)

View Item View Item