scholarly journals Common operation scheduling with general processing times: A branch-and-cut algorithm to minimize the weighted number of tardy jobs

Omega ◽  
2019 ◽  
Vol 84 ◽  
pp. 18-30 ◽  
Author(s):  
Claudio Arbib ◽  
Giovanni Felici ◽  
Mara Servilio
Keyword(s):  
Branch And Cut ◽  
Processing Times ◽  
Number Of Tardy Jobs ◽  
Common Operation ◽  
Weighted Number ◽  
Tardy Jobs ◽  
Operation Scheduling

scholarly journals Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Jianbo Qian ◽  
George Steiner
Keyword(s):  
Single Machine ◽  
Single Machine Scheduling ◽  
Time Dependent ◽  
Scheduling Problems ◽  
Processing Times ◽  
Number Of Tardy Jobs ◽  
Special Cases ◽  
Programming Techniques ◽  
Weighted Number ◽  
Tardy Jobs

We consider single machine scheduling problems with learning/deterioration effects and time-dependent processing times, with due date assignment consideration, and our objective is to minimize the weighted number of tardy jobs. By reducing all versions of the problem to an assignment problem, we solve them inO(n4) time. For some important special cases, the time complexity can be improved to beO(n2) using dynamic programming techniques.

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.

Sign in / Sign up

Export Citation Format

Share Document