Modeling lotsizing and scheduling problems with sequence dependent setups

2014 ◽  
Vol 239 (3) ◽  
pp. 644-662 ◽  
Author(s):  
Luis Guimarães ◽  
Diego Klabjan ◽  
Bernardo Almada-Lobo
Keyword(s):  
Scheduling Problems ◽  
Sequence Dependent ◽  
Lotsizing And Scheduling

Comparison of Heuristic for Flow Shop Scheduling Problems with Sequence Dependent Setup Time

2011 ◽  
Vol 339 ◽  
pp. 332-335 ◽  
Author(s):  
Parinya Kaweegitbundit
Keyword(s):  
Flow Shop ◽  
Memetic Algorithm ◽  
Setup Time ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Sequence Dependent ◽  
Sequence Dependent Setup Time ◽  
Sequence Dependent Setup ◽  
Makespan Criterion

This paper considers flow shop scheduling problems with sequence dependent setup time. The makespan criterion has been considered. In this paper presented a comparison of three heuristics for solves this problem. The memetic algorithm, genetic algorithm and NEH heuristic have been compared. In the experimental, the result from memetic algorithm is maximum the best solution. Therefore, the MA heuristic outperforms other heuristic.

Sequence-dependent group scheduling problems in flexible flow shops

2006 ◽  
Vol 102 (1) ◽  
pp. 66-86 ◽  
Author(s):  
Rasaratnam Logendran ◽  
Paula deSzoeke ◽  
Faith Barnard
Keyword(s):  
Group Scheduling ◽  
Scheduling Problems ◽  
Flow Shops ◽  
Sequence Dependent

scholarly journals Scheduling  with position-dependent weights, due-date assignment and past-sequence-dependent setup times

2020 ◽  
Author(s):  
Li-Yan Wang ◽  
Xue Huang ◽  
Wei-Wei Liu ◽  
Yu-Bin Wu ◽  
Ji-Bo Wang
Keyword(s):  
Single Machine Scheduling ◽  
Setup Times ◽  
Scheduling Problems ◽  
Due Date ◽  
Due Date Assignment ◽  
Sequence Dependent ◽  
Dependent Setup Times ◽  
Machine Scheduling Problems ◽  
Slk Due Date Assignment ◽  
Sequence Dependent Setup Times

In this study, we consider single-machine scheduling problems with  past-sequence-dependent (denoted by psd) setup times in which the setup times of jobs are proportional to the length of already processed jobs. Under  common (CON) and slack (SLK) due-date assignment methods, we prove that the   weighted sum of earliness, tardiness and due-date minimization remains polynomially solvable.  We also give some extensions for the scheduling problems with  psd setup times.

Sign in / Sign up

Export Citation Format

Share Document