On Scheduling Pseudo Just-in-Time Jobs on Single Machine
We are dealing with the problem of maximizing the weighted number of pseudo just-in-time jobs on single machine model.The concept of pseudo just-in-time is a relaxation of just-in-time.In our formulation,each job is associated with a time-window instead of due date,and the lengths of all such time-windows are bounded above by a certain value given in advanced.A job is called pseudo just-in-time if it is completed within its time-window.We show that the problem is polynomial time solvable,and moreover,we show some results on computational complexity for more general settings.
Scheduling Algorithm Just-in-Time
Yuka Kawamata Shao-Chin Sung
Application Management Services Unit B,IT Management Services Group,IT Frontier Corporation Department of Industrial and Systems Engineering,College of Science and Engineering,Aoyama Gakuin Un
国际会议
长沙
英文
335-340
2014-05-31（万方平台首次上网日期，不代表论文的发表时间）