Scheduling Jobs on a Single Machine With Dirt Cleaning Consideration to Minimize Total Completion Time

This paper studies a single-machine scheduling problem observed in the wafer manufacturing process, where the machine must receive periodical maintenance so that the dirt generated in the process does not exceed the limit. The objective is to minimize the total completion times. A mixed binary integ...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE access Ročník 7; s. 22290 - 22300
Hlavní autoři: Chen, Yarong, Su, Ling-Huey, Tsai, Ya-Chih, Huang, Shenquan, Chou, Fuh-Der
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Cleaning
Completion time
Dirt
Exact solutions
Heuristic
Heuristic algorithms
Integer programming
Job shop scheduling
Job shops
Lower bounds
machine unavailability
Maintenance engineering
mixed binary integer programming
Schedules
Scheduling
Single machine scheduling
total completion time
ISSN:2169-3536, 2169-3536
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 paper studies a single-machine scheduling problem observed in the wafer manufacturing process, where the machine must receive periodical maintenance so that the dirt generated in the process does not exceed the limit. The objective is to minimize the total completion times. A mixed binary integer programming model is formulated, and, due to its computational intractability for large problems, three effective heuristics are proposed based on our developed properties. The proposed heuristics are evaluated by comparison with exact solutions on small problems and with lower bounds on large problems. The experimental results show that the INDEX-LOE heuristic yields high-quality solutions in comparison with those obtained from the other two heuristics. Furthermore, the impacts of dirt accumulation and cleaning time are discussed in detail.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2019.2898905