Minimizing the Total Weighted Completion Time of a Single Machine With Flexible Maintenance
This paper investigates the NP-hard problem of scheduling $n$ jobs on a single machine, where the machine must be stopped periodically for maintenance after a certain continuous working time. The objective is to minimize the total weighted completion time. Two-phase heuristic algorithms are proposed...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8815720/ |