Minimizing total flow time subject to preemption penalties in online scheduling

There has been extensive research over the decades on the preemptive scheduling. However, little attention has been devoted to problems where a certain time penalty such as setup times is incurred when preemption is allowed. In this paper, we consider the single-machine scheduling problem of minimiz...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of advanced manufacturing technology Vol. 47; no. 1-4; pp. 227 - 236
Main Authors Heydari, Mehdi, Sadjadi, Seyed Jafar, Mohammadi, Emran
Format Journal Article
LanguageEnglish
Published London Springer-Verlag 01.03.2010
Springer Nature B.V
Subjects
CAE) and Design
Computer-Aided Engineering (CAD
Engineering
Heuristic methods
Industrial and Production Engineering
Job shops
Mechanical Engineering
Media Management
Original Article
Preempting
Preemption
Production scheduling
Scheduling
Setup times
Time dependence
Preemptive scheduling
Preemption-resume
Setup time
Preemption penalty
Preemption-restart
Online AccessGet full text

Cover

More Information
Summary:There has been extensive research over the decades on the preemptive scheduling. However, little attention has been devoted to problems where a certain time penalty such as setup times is incurred when preemption is allowed. In this paper, we consider the single-machine scheduling problem of minimizing the total flow time subject to job release dates and preemption penalties. When a job is started, whether initially or after being preempted, a job-dependent setup time must take place. The problem is strongly NP-hard even if the setup time is one unit. Therefore, we present a heuristic approach and validate it using some numerical examples.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-009-2190-9