scholarly journals A new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs

2012 ◽  
Vol 3 (2) ◽  
pp. 253-264 ◽  
Author(s):  
Hamidreza Haddad ◽  
Payam Ghanbari ◽  
Ahmad Zeraatkar Moghaddam
Keyword(s):  
Mathematical Model ◽  
Single Machine ◽  
Deteriorating Jobs ◽  
Maximum Lateness ◽  
Batch Scheduling ◽  
Scheduling Problem

scholarly journals Single-Machine Parallel-Batch Scheduling with Nonidentical Job Sizes and Rejection

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 258
Author(s):  
Miaomiao Jin ◽  
Xiaoxia Liu ◽  
Wenchang Luo
Keyword(s):  
Integer Programming ◽  
Single Machine ◽  
Heuristic Algorithms ◽  
Batch Processing ◽  
Batch Scheduling ◽  
Scheduling Problem ◽  
Programming Formulation ◽  
Processing Times ◽  
Batch Processing Machine ◽  
Rejection Penalty

We investigate the single-machine parallel-batch scheduling problem with nonidentical job sizes and rejection. In this problem, a set of jobs with different processing times and nonidentical sizes is given to be possibly processed on a parallel-batch processing machine. Each job is either accepted and then processed on the machine or rejected by paying its rejection penalty. Preemption is not allowed. Our task is to choose the accepted jobs and schedule them as batches on the machine to minimize the makespan of the accepted jobs plus the total rejection penalty of the rejected jobs. We provide an integer programming formulation to exactly solve our problem. Then, we propose three fast heuristic algorithms to solve the problem and evaluate their performances by using a small numerical example.

scholarly journals Single-Machine Scheduling with Workload-Dependent Maintenance Duration to Minimize Maximum Lateness

2015 ◽  
Vol 2015 ◽  
pp. 1-5 ◽  
Author(s):  
Ting Wang ◽  
Dehua Xu
Keyword(s):  
Single Machine ◽  
Time Window ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Maximum Lateness ◽  
Scheduling Problem ◽  
Due Date ◽  
Start Time ◽  
Tight Bound ◽  
Special Cases

A single-machine scheduling problem with a mandatory maintenance whose duration is workload-dependent is considered. The start time of the maintenance is restricted to a time window. The objective is to determine the start time of the maintenance and schedule all the jobs to the machine such that the maximum lateness is minimized. An approximation algorithm based on the classical Earliest Due Date first rule is proposed. It is showed that the proposed algorithm is optimal for some special cases and that it has a tight bound for the scheduling problem under consideration.

Sign in / Sign up

Export Citation Format

Share Document