Scheduling Jobs on a Single Machine With Dirt Cleaning Consideration to Minimize Total Completion Time
| Autor: | Shenquan Huang, Fuh-Der Chou, Yarong Chen, Ling-Huey Su, Ya-Chih Tsai |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Binary integer programming
0209 industrial biotechnology Mathematical optimization General Computer Science Job shop scheduling Scheduling Computer science Heuristic General Engineering Dirt 02 engineering and technology Scheduling (computing) total completion time 020901 industrial engineering & automation heuristic algorithms 0202 electrical engineering electronic engineering information engineering mixed binary integer programming machine unavailability 020201 artificial intelligence & image processing General Materials Science lcsh:Electrical engineering. Electronics. Nuclear engineering Completion time Heuristics lcsh:TK1-9971 |
| Zdroj: | IEEE Access, Vol 7, Pp 22290-22300 (2019) |
| ISSN: | 2169-3536 |
| DOI: | 10.1109/access.2019.2898905 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|