Single machine lot scheduling with optional job-rejection

2020 ◽  
Author(s):  
Baruch Mor ◽  
Gur Mosheiov ◽  
Dana Shapira
Keyword(s):  
Single Machine ◽  
Lot Scheduling ◽  
Job Rejection

scholarly journals A Batching Machine Model for Lot Scheduling on a Single Machine

2018 ◽  
Vol 43 (1) ◽  
pp. 37-40
Author(s):  
Mikhail Y. Kovalyov
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Optimal Solution ◽  
Time Algorithm ◽  
Machine Model ◽  
Average Completion Time ◽  
Lot Scheduling ◽  
Batching Machine ◽  
Machine Problem ◽  
Total Average

Abstract A recently introduced lot scheduling problem is considered. It is to find a partition of jobs of n orders into lots and to sequence these lots on a single machine so that the total average completion time of the orders is minimized. A simple O(n log n) time algorithm is presented for this problem in the literature, with a relatively sophisticated proof of its optimality. We show that modeling this problem as a classic batching machine problem makes its optimal solution obvious.

Lot scheduling on a single machine

2014 ◽  
Vol 114 (12) ◽  
pp. 718-722 ◽  
Author(s):  
Yung-Tsung Hou ◽  
Dar-Li Yang ◽  
Wen-Hung Kuo
Keyword(s):  
Single Machine ◽  
Lot Scheduling

scholarly journals Single-machine scheduling under the job rejection constraint

2010 ◽  
Vol 411 (16-18) ◽  
pp. 1877-1882 ◽  
Author(s):  
Liqi Zhang ◽  
Lingfa Lu ◽  
Jinjiang Yuan
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Job Rejection

scholarly journals Single-Machine Scheduling with Job Rejection, Deteriorating Effects, and Deteriorating Maintenance Activities

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Haiwei Nian ◽  
Zhizhong Mao
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Job Rejection ◽  
Optimal Maintenance ◽  
Deterioration Effect ◽  
Maintenance Activities ◽  
The Cost ◽  
Rejection Penalty

This paper addresses the single-machine scheduling problems with simultaneous considerations of job rejection, deterioration effects, and deteriorating multimaintenance activities. A job is either rejected, in which case a rejection penalty has to be paid, or accepted and processed on the single machine. Three deterioration effect models are investigated, and it is assumed that each machine may be subject to several maintenance activities over the scheduling horizon, and the duration of the maintenance depends on its running time. Moreover, due to the restriction of the budget of maintenance, the upper bound of the total maintenance frequencies on the machine is assumed to be known in advance. The objective is to find jointly the optimal accepted job set, the optimal maintenance frequencies, the optimal maintenance positions, and the optimal accepted job sequence such that the cost function based on the total completion time and rejection penalty is minimized. It is shown that all the versions of the problem under study are polynomial time solutions.

Sign in / Sign up

Export Citation Format

Share Document