Ya-Chih Tsai
ABSTRACT
This paper considers the problem of scheduling n resumable jobs to minimize total weighted completion time, in which maintenance activities periodically occur after a continuously working time. This problem has been proven to be NP-hard. Using lower bounds and several dominance rules, a branch and bound scheme is proposed to solve optimally efficiently for small problems. A mixed integer programming model is also introduced to obtain benchmark solutions.
- Yang, D. L., Hung, C. L., Hsu, C. J., and Chern, M. S. 2002. Minimizing the makespan in a single machine scheduling problem with a flexible maintenance. J. Chin. Inst. Ind. Eng., 19, (Feb. 2002), 63--66.Google Scholar
- Schmidt, G. 2000. Scheduling with limited machine availability. Eur. J. Oper. Res., 121, (Feb. 2000), 1--15.Google ScholarCross Ref
- Ma, Y., Chu, C., and Zuo, C. 2010. A survey of scheduling with deterministic machine availability constraints. Comput. Ind. Eng., 58, (Mar. 2010), 199--211. Google ScholarDigital Library
- Lee, C.-Y. 2004. Machine scheduling with availability constraints. Handbook of scheduling, CRC Press, 2004, pp. 22.1--22.13.Google Scholar
- Detienne, B. 2012. Minimizing the weighted number of late semi-resumable jobs with deterministic machine availability constraints," in Proc. 14th IFAC Symposium on Information Control Problems in Manufacturing Bucharest, 2012, pp. 111--116.Google Scholar
- Lee, C.-Y. 1996. Machine scheduling with an availability constraint. J. Global Optim., 9, (Sep. 1996). 395--416.Google ScholarCross Ref
- Wang, G., Sun, H., and Chu, C., 2005. Preemptive scheduling with availability constraints to minimize total weighted completion times. Ann. Oper. Res., 133, (Jan. 2005), 183--192.Google Scholar
- Fan, B., Li, S., Zhou, L., and Zhang, L., 2011. Scheduling resumable deteriorating jobs on a single machine with non-availability constraints. Theor. Comput. Sci., 412, (Feb. 2011), 275--280. Google ScholarDigital Library
- Wu, C. C. and Lee, W. C. 2003. Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine. Inform. Process. Lett., 87, (Jul. 2003), 89--93. Google ScholarDigital Library
Index Terms
- Minimizing Total Weighted Completion Time on a Single Machine Scheduling Problem with Resumable Jobs and Flexible Maintenance
Recommendations
Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
In this paper, we study the online scheduling of linear deteriorating jobs on a single machine to minimize the total weighted completion time. In the problem, a set of n independent linear deteriorating jobs arriving online over time has to be scheduled ...
A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
We present a e/(e1)-approximation algorithm for the nonpreemptive scheduling problem to minimize the total weighted completion time of jobs on a single machine subject to release dates and precedence constraints. The previously best known approximation ...
Minimizing total weighted completion time under makespan constraint for two-agent scheduling with job-dependent aging effects
Two-agent single-machine scheduling with linear job-dependent position-based aging effects.Branch-and-bound algorithm with properties for dominance and feasibility.Efficient simulated annealing using three different methods to generate the initial ...
Comments