Two-parallel machines scheduling with rate-modifying activities to minimize total completion time

This paper considers the two-parallel machines scheduling problem with rate-modifying activities. In this model, each machine has a rate-modifying activity that can change the processing rate of machine under consideration. Hence the actual processing times of jobs vary depending on whether the job...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:European journal of operational research Ročník 198; číslo 1; s. 354 - 357
Hlavní autori: Zhao, Chuan-Li, Tang, Heng-Yong, Cheng, Cong-Dian
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 01.10.2009
Elsevier
Elsevier Sequoia S.A
Edícia:European Journal of Operational Research
Predmet:
Algorithm
Applied sciences
Decision theory. Utility theory
Exact sciences and technology
Inventory control, production control. Distribution
Mathematical programming
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Parallel machines
Rate-modifying activities
Scheduling
Scheduling Parallel machines Rate-modifying activities Algorithm
Scheduling, sequencing
Sequential scheduling
Studies
Parallel machines
Rate-modifying activities
Scheduling
Algorithm
Multiple machine
Decision making
Minimization
Processing time
Makespan
Polynomial method
Modeling
Polynomial time
Objective function
Execution time
ISSN:0377-2217, 1872-6860
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper considers the two-parallel machines scheduling problem with rate-modifying activities. In this model, each machine has a rate-modifying activity that can change the processing rate of machine under consideration. Hence the actual processing times of jobs vary depending on whether the job is scheduled before or after the rate-modifying activity. We need to make a decision on when to schedule the rate-modifying activities and the sequence of jobs to minimize some objective function. We provide polynomial and pseudo-polynomial time algorithms to solve the total completion time minimization problem and total weighted completion time minimization problem under agreeable ratio condition.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2008.08.012