A due-date assignment model for a flow shop with application in a lightguide cable shop

1991 ◽  
Vol 10 (1) ◽  
pp. 1-7 ◽  
Author(s):  
J.R. Rajasekera ◽  
M.R. Murr ◽  
K.C. So
Keyword(s):  
Flow Shop ◽  
Due Date ◽  
Due Date Assignment ◽  
Assignment Model

Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights

2020 ◽  
Vol 37 (03) ◽  
pp. 2050014
Author(s):  
Wei-Wei Liu ◽  
Chong Jiang
Keyword(s):  
Resource Allocation ◽  
Learning Effect ◽  
Flow Shop ◽  
Due Date ◽  
Due Date Assignment ◽  
Polynomial Time Algorithms ◽  
Optimality Properties ◽  
No Wait ◽  
Special Case ◽  
Order Algorithm

In this paper, the flow shop resource allocation scheduling with learning effect and position-dependent weights on two-machine no-wait setting is considered. Under common due date assignment and slack due date assignment rules, a bi-criteria analysis is provided. The optimality properties and polynomial time algorithms are developed to solve four versions of the problem. For a special case of the problem, it is proved that the problem can be optimally solved by a lower order algorithm.

A note on a due-date assignment on a two-machine flow-shop

2004 ◽  
Vol 31 (3) ◽  
pp. 473-480 ◽  
Author(s):  
Motty Birman ◽  
Gur Mosheiov
Keyword(s):  
Flow Shop ◽  
Due Date ◽  
Due Date Assignment
Sign in / Sign up

Export Citation Format

Share Document