A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times

2007 ◽  
Vol 17 (2) ◽  
pp. 206-213 ◽  
Author(s):  
Jinjiang Yuan ◽  
Shisheng Li ◽  
Ji Tian ◽  
Ruyan Fu
Keyword(s):  
Single Machine ◽  
Batch Scheduling ◽  
Delivery Times ◽  
On Line

Single machine batch scheduling with release times and delivery costs

2011 ◽  
Vol 16 (1) ◽  
pp. 69-79 ◽  
Author(s):  
Esaignani Selvarajah ◽  
George Steiner ◽  
Rui Zhang
Keyword(s):  
Single Machine ◽  
Batch Scheduling ◽  
Release Times ◽  
Delivery Costs

scholarly journals Online batch scheduling on parallel machines with delivery times

2011 ◽  
Vol 412 (39) ◽  
pp. 5333-5339 ◽  
Author(s):  
Yang Fang ◽  
Xiwen Lu ◽  
Peihai Liu
Keyword(s):  
Parallel Machines ◽  
Batch Scheduling ◽  
Delivery Times

Single Machine Scheduling and due Date Assignment with Past-Sequence-Dependent Delivery Times and General Position-Dependent Processing Times

2014 ◽  
Vol 624 ◽  
pp. 675-680
Author(s):  
Yu Fang Zhao
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Due Date ◽  
Due Date Assignment ◽  
Processing Times ◽  
Delivery Times ◽  
Weighted Number ◽  
Tardy Jobs

We studied single machine scheduling problems in which the jobs need to be delivered to customers after processing. It is assumed that the delivery times are proportional to the length of the already processed jobs, and a job's processing time depended on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs and the cost of due date assignment. We analyzed these problems with two different due date assignment methods and conclude that the problems are polynomial time solvable.

Online Single Machine Batch Scheduling

2006 ◽  
pp. 424-435
Author(s):  
Beat Gfeller ◽  
Leon Peeters ◽  
Birgitta Weber ◽  
Peter Widmayer
Keyword(s):  
Single Machine ◽  
Batch Scheduling
Sign in / Sign up

Export Citation Format

Share Document