Please use this identifier to cite or link to this item:
Title: The early-tardy distinct due date machine scheduling problem with job splitting
Keywords: early-tardy machine scheduling, parallel machine scheduling, distinct due dates, scheduling search algorithms, constraint satisfaction, splitting jobs
Issue Date: 19-Jul-2004
Citation: HO KAH YUAN, BERNICE (2004-07-19). The early-tardy distinct due date machine scheduling problem with job splitting. ScholarBank@NUS Repository.
Abstract: We introduce a new scheduling problem, the early-tardy machine scheduling problem with distinct due dates and splitting jobs with setup times on uniform parallel machines (ETDDDsplit). It combines characteristics from 2 known scheduling problems - the early-tardy scheduling problem with distinct due dates and scheduling with splitting jobs. The ETDDDsplit problem is NP-complete, and does not appear in any literature to date. We applied Tabu search, genetic algorithm, simulated annealing and a new greedy heuristic to variations of the problem. The heuristics were run on test cases using 200 jobs on 5 parallel machines, with a schedule length of 2000 time units. The jobs had machine- and sequence-independent setup times. Special jobs - maintenance jobs and breakdown jobs - were also included. Where the jobs were well-spread out, the heuristics generally performed well. However, the heuristics performed poorly when the jobs were closely packed together.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
HoKYB.pdf1.32 MBAdobe PDF



Page view(s)

checked on Jan 13, 2019


checked on Jan 13, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.