Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system

This study addresses the identical parallel machine scheduling problem in which the total earliness and tardiness about a common due date are minimized subject to minimum total flowtime, P ∥ ( E + T ) / ∑ C i . The problem is demonstrated to be transformed into a simplified version of the parallel m...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 36; číslo 2; s. 461 - 471
Hlavní autor: Su, Ling-Huey
Médium: Journal Article
Jazyk:angličtina
Vydáno: Kidlington Elsevier Ltd 01.02.2009
Elsevier
Pergamon Press Inc
Témata:
Applied sciences
Exact sciences and technology
Flowtime
Hierarchical criteria
Integer programming
Inventory control, production control. Distribution
Job shops
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Parallel machine scheduling
Problem solving
Production scheduling
Scheduling, sequencing
Studies
Total earliness and tardiness
Hierarchical criteria
Total earliness and tardiness
Parallel machine scheduling
Flowtime
Parallel machines
Scheduling
Makespan
Modeling
Due date
Optimization
Integer programming
Zero one programming
Completion time
ISSN:0305-0548, 1873-765X, 0305-0548
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This study addresses the identical parallel machine scheduling problem in which the total earliness and tardiness about a common due date are minimized subject to minimum total flowtime, P ∥ ( E + T ) / ∑ C i . The problem is demonstrated to be transformed into a simplified version of the parallel machine problem with the objective of minimizing makespan subject to minimum total flowtime, P ∥ C max / ∑ C i . Several properties are considered to solve optimally the restricted version of the problem. A streamlined binary integer programming model is developed to solve the P ∥ C max / ∑ C i problem and the P ∥ ( E + T ) / ∑ C i problem. Computational experiments indicate that the binary integer programming model is superior to the existing optimization algorithm for the P ∥ C max / ∑ C i problem in the literature.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2007.09.013