Multi-objective inverse scheduling optimization of single-machine shop system with uncertain due-dates and processing times

2017 ◽  
Vol 20 (1) ◽  
pp. 371-390 ◽  
Author(s):  
Jianhui Mou ◽  
Liang Gao ◽  
Xinyu Li ◽  
Quanke Pan ◽  
Jiancai Mu
Keyword(s):  
Single Machine ◽  
Due Dates ◽  
Scheduling Optimization ◽  
Machine Shop ◽  
Multi Objective ◽  
Processing Times ◽  
Inverse Scheduling

scholarly journals Stochastic Single Machine JIT Scheduling with Geometric Processing Times and Due Dates

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Yuncheng Luo
Keyword(s):  
Single Machine ◽  
Optimal Schedule ◽  
Dynamic Programming Algorithm ◽  
Programming Algorithm ◽  
Scheduling Problem ◽  
Due Dates ◽  
Common Mean ◽  
Processing Times ◽  
Tardy Jobs ◽  
Special Case

In this paper, we investigate a static stochastic single machine JIT scheduling problem in which the jobs’ processing times are stochastically independent and follow geometric distributions whose mean is provided, due dates are geometrically distributed with a common mean, and both the unit penalty of earliness/tardiness and the fixed penalty of earliness/tardiness are deterministic and different. The objective is to minimize the expected total penalties for quadratic earliness, quadratic tardiness, and early and tardy jobs. We prove that the optimal schedule to minimize this problem is V-shaped with respect to the ratio of mean processing time to unit tardiness penalty under the specific condition. Also, we show a special case and two theorems related to this JIT scheduling problem under specific situations where the optimal solutions exist. Finally, based on the V-shaped characteristic, a dynamic programming algorithm is designed to achieve an optimal V-shaped schedule in pseudopolynomial time.

Single Machine Multiple Common due Dates Assignment Based on Common Flow Allowance and Resource-Dependent Processing Times

2014 ◽  
Vol 644-650 ◽  
pp. 2022-2025
Author(s):  
Cheng Xin Luo ◽  
En Min Feng
Keyword(s):  
Single Machine ◽  
Optimal Algorithm ◽  
Due Dates ◽  
Due Date ◽  
Earliness And Tardiness ◽  
Processing Times ◽  
Resource Cost ◽  
The Common ◽  
Resource Allocation Scheme ◽  
Flow Allowance

This paper studies a multiple common due date assignment problem on a single machine. The job-dependent due dates are obtained based on common flow allowance criteria. We assume that the processing time of a job is controllable by the resource amount assigned to it. The objective is to find the optimal multiple common dues, the set of jobs assigned to each due date, the sequence of jobs and resource allocation scheme to minimize a total cost based on earliness and tardiness of jobs, the common dues and resource cost. We propose an optimal algorithm to solve the problem.

Sign in / Sign up

Export Citation Format

Share Document