Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity

2014 ◽  
Vol 52 (19) ◽  
pp. 5583-5596 ◽  
Author(s):  
Yunqiang Yin ◽  
T.C.E. Cheng ◽  
Chin-Chia Wu ◽  
Shuenn-Ren Cheng
Keyword(s):  
Single Machine ◽  
Due Date ◽  
Due Date Assignment ◽  
Common Due Date ◽  
Batch Delivery ◽  
Delivery Scheduling

Single-Machine Batch Delivery Scheduling and Common due Date Assignment with Identical Processing Times

2014 ◽  
Vol 635-637 ◽  
pp. 1884-1889 ◽  
Author(s):  
Xing Zi Xie ◽  
Xiu Li Wang
Keyword(s):  
Single Machine ◽  
Optimal Schedule ◽  
Dynamic Programming Algorithm ◽  
Programming Algorithm ◽  
Due Date ◽  
Common Due Date ◽  
Processing Times ◽  
Batch Delivery ◽  
Weighted Earliness ◽  
Delivery Scheduling

This paper considers the problem of single-machine batch delivery scheduling with an assignable common due date where all jobs have identical processing times. Finished jobs are delivered in batches and the cost per batch delivery is fixed and independent of the number of jobs in the batch. For our problem, the penalties of earliness-tardiness are assumed to be arbitrarily weighted but the holding costs are equally weighted. The objective is to determine the common due date and find an optimal schedule to minimize the sum of total weighted earliness, tardiness, holding, due date, and delivery costs. We present some basic properties of the structure of the optimal schedule for the problem, and provide a polynomial dynamic programming algorithm.

Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents

2018 ◽  
Vol 65 (5) ◽  
pp. 393-409 ◽  
Author(s):  
Yunqiang Yin ◽  
Yongjian Yang ◽  
Dujuan Wang ◽  
T.C.E. Cheng ◽  
Chin-Chia Wu
Keyword(s):  
Due Date ◽  
Due Date Assignment ◽  
Integrated Production ◽  
Batch Delivery ◽  
Production Inventory ◽  
Delivery Scheduling

scholarly journals Scheduling and Common Due Date Assignment on a Single Parallel-Batching Machine with Batch Delivery

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Hua Gong ◽  
Biao Zhang ◽  
Wuliang Peng
Keyword(s):  
Processing Time ◽  
Due Date ◽  
Due Date Assignment ◽  
Common Due Date ◽  
Parallel Batching ◽  
Batch Delivery ◽  
Delivery Date ◽  
Special Cases ◽  
Batching Machine ◽  
Production Part

We consider a single parallel-batching machine scheduling problem with delivery involving both batching scheduling and common due date assignment. The orders are first processed on the single parallel-batching machine and then delivered in batches to the customers. The batching machine can process several orders at the same time. The processing time of a production batch on the machine is equal to the longest processing time of the orders assigned into this batch. A common due date for all the orders in the same delivery batch and a delivery date for each order need to be determined in order to minimize total weighted flow time. We first prove that this problem is NP hard in the strong sense. Two optimal algorithms by using dynamic programming are derived for the two special cases with a given sequence of orders on the machine and a given batching in the production part, respectively.

scholarly journals Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment

2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Long Wan
Keyword(s):  
Single Machine ◽  
Optimal Solution ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Due Date ◽  
Due Date Assignment ◽  
Common Due Date ◽  
Optimal Polynomial ◽  
Special Case ◽  
Identical Jobs

We investigate a common due-date assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness, and due-date cost. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a numerical example.

Sign in / Sign up

Export Citation Format

Share Document