Admission policies for the customized stochastic lot scheduling problem with strict due-dates

2011 ◽  
Vol 213 (2) ◽  
pp. 375-383 ◽  
Author(s):  
Remco Germs ◽  
Nicky D. Van Foreest
Keyword(s):  
Scheduling Problem ◽  
Due Dates ◽  
Lot Scheduling ◽  
Admission Policies

A robust customer order scheduling problem along with scenario-dependent component processing times and due dates

2021 ◽  
Vol 58 ◽  
pp. 291-305
Author(s):  
Chin-Chia Wu ◽  
Danyu Bai ◽  
Xingong Zhang ◽  
Shuenn-Ren Cheng ◽  
Jia-Cheng Lin ◽  
...  
Keyword(s):  
Scheduling Problem ◽  
Due Dates ◽  
Order Scheduling ◽  
Processing Times ◽  
Customer Order ◽  
Dependent Component ◽  
Customer Order Scheduling

The economic lot scheduling problem under extended basic period and power-of-two policy

2009 ◽  
Vol 4 (2) ◽  
pp. 157-172 ◽  
Author(s):  
Hainan Sun ◽  
Huei-Chuen Huang ◽  
Wikrom Jaruphongsa
Keyword(s):  
Scheduling Problem ◽  
Lot Scheduling ◽  
Basic Period ◽  
Economic Lot Scheduling Problem ◽  
Economic Lot Scheduling

scholarly journals Economic lot scheduling problem with consideration of money time value

2010 ◽  
Vol 1 (2) ◽  
pp. 121-138 ◽  
Author(s):  
Maryam Mokhlesian ◽  
Seyyed Mohammad Taghi Fatemi Ghomi ◽  
Fariborz Jolai
Keyword(s):  
Scheduling Problem ◽  
Lot Scheduling ◽  
Time Value ◽  
Economic Lot Scheduling Problem ◽  
Economic Lot Scheduling

scholarly journals Metaheuristics for Order Scheduling Problem with Unequal Ready Times

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Jan-Yee Kung ◽  
Jiahui Duan ◽  
Jianyou Xu ◽  
I-Hong Chung ◽  
Shuenn-Ren Cheng ◽  
...  
Keyword(s):  
Real Life ◽  
Experimental Tests ◽  
Service Systems ◽  
Scheduling Problem ◽  
Due Dates ◽  
Order Scheduling ◽  
Customer Order ◽  
Scheduling Model ◽  
Unequal Ready Times ◽  
Customer Order Scheduling

In recent years, various customer order scheduling (OS) models can be found in numerous manufacturing and service systems in which several designers, who have developed modules independently for several different products, convene as a product development team, and that team completes a product design only after all the modules have been designed. In real-life situations, a customer order can have some requirements including due dates, weights of jobs, and unequal ready times. Once encountering different ready times, waiting for future order or job arrivals to raise the completeness of a batch is an efficient policy. Meanwhile, the literature releases that few studies have taken unequal ready times into consideration for order scheduling problem. Motivated by this limitation, this study addresses an OS scheduling model with unequal order ready times. The objective function is to find a schedule to optimize the total completion time criterion. To solve this problem for exact solutions, two lower bounds and some properties are first derived to raise the searching power of a branch-and-bound method. For approximate solution, four simulated annealing approaches and four heuristic genetic algorithms are then proposed. At last, several experimental tests and their corresponding statistical outcomes are also reported to examine the performance of all the proposed methods.

scholarly journals Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem

Algorithms ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 246
Author(s):  
Yuri N. Sotskov ◽  
Еvangelina I. Mihova
Keyword(s):  
Graph Coloring ◽  
Precedence Constraints ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Due Dates ◽  
Mixed Graph ◽  
Coloring Problem ◽  
Release Times ◽  
Schedule Length ◽  
Graph Coloring Problem

This article extends the scheduling problem with dedicated processors, unit-time tasks, and minimizing maximal lateness for integer due dates to the scheduling problem, where along with precedence constraints given on the set of the multiprocessor tasks, a subset of tasks must be processed simultaneously. Contrary to a classical shop-scheduling problem, several processors must fulfill a multiprocessor task. Furthermore, two types of the precedence constraints may be given on the task set . We prove that the extended scheduling problem with integer release times of the jobs to minimize schedule length may be solved as an optimal mixed graph coloring problem that consists of the assignment of a minimal number of colors (positive integers) to the vertices of the mixed graph such that, if two vertices and are joined by the edge , their colors have to be different. Further, if two vertices and are joined by the arc , the color of vertex has to be no greater than the color of vertex . We prove two theorems, which imply that most analytical results proved so far for optimal colorings of the mixed graphs , have analogous results, which are valid for the extended scheduling problems to minimize the schedule length or maximal lateness, and vice versa.

Testing Feasibility in a Lot Scheduling Problem

1990 ◽  
Vol 38 (6) ◽  
pp. 1079-1088 ◽  
Author(s):  
Edward J. Anderson
Keyword(s):  
Scheduling Problem ◽  
Lot Scheduling
Sign in / Sign up

Export Citation Format

Share Document