A hybrid algorithm for earliness-tardiness scheduling problem with sequence dependent setup time

2002 ◽  
Author(s):  
Li Wang ◽  
Mengguang Wang
Keyword(s):  
Hybrid Algorithm ◽  
Setup Time ◽  
Scheduling Problem ◽  
Sequence Dependent ◽  
Sequence Dependent Setup Time ◽  
Sequence Dependent Setup

scholarly journals Study on column generation for the lot-sizing and scheduling problem with sequencedependent setup time

2018 ◽  
Vol 189 ◽  
pp. 06002
Author(s):  
Dandan Zhang ◽  
Canrong Zhang
Keyword(s):  
Lot Sizing ◽  
Setup Time ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Optimal Solutions ◽  
Sequence Dependent ◽  
Sequence Dependent Setup Time ◽  
Capacitated Lot Sizing ◽  
Sequence Dependent Setup ◽  
Lot Sizing And Scheduling

The capacitated lot-sizing and scheduling problem with sequence-dependent setup time and carryover setup state is a challenge problem in the semiconductor assembly and test manufacturing. For the problem, a new mixed integer programming model is proposed, followed by exploring its relative efficiency in obtaining optimal solutions and linearly relaxed optimal solutions. On account of the sequence-dependent setup time and the carryover of setup states, a per-machine Danzig Wolfe decomposition is proposed. We then build a statistical estimation model to describe correlation between the optimal solutions and two lower bounds including the linear relaxation solutions, and the pricing sub-problem solutions of Danzig Wolfe decomposition, which gives insight on the optimal values about information regarding whether or not the setup variables in the optimal solution take the value of 1, and the information is further used in the branch and select procedure. Numerical experiments are conducted to test the performance of the algorithm.

scholarly journals Robust Parallel Machine Scheduling Problem with Uncertainties and Sequence-Dependent Setup Time

2016 ◽  
Vol 2016 ◽  
pp. 1-13 ◽  
Author(s):  
Hongtao Hu ◽  
K. K. H. Ng ◽  
Yichen Qin
Keyword(s):  
Machine Scheduling ◽  
Setup Time ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Computational Time ◽  
Scheduling Problem ◽  
Sequence Dependent ◽  
Sequence Dependent Setup Time ◽  
Parallel Machine Scheduling Problem ◽  
Sequence Dependent Setup

A parallel machine scheduling problem in plastic production is studied in this paper. In this problem, the processing time and arrival time are uncertain but lie in their respective intervals. In addition, each job must be processed together with a mold while jobs which belong to one family can share the same mold. Therefore, time changing mold is required for two consecutive jobs that belong to different families, which is known as sequence-dependent setup time. This paper aims to identify a robust schedule by min–max regret criterion. It is proved that the scenario incurring maximal regret for each feasible solution lies in finite extreme scenarios. A mixed integer linear programming formulation and an exact algorithm are proposed to solve the problem. Moreover, a modified artificial bee colony algorithm is developed to solve large-scale problems. The performance of the presented algorithm is evaluated through extensive computational experiments and the results show that the proposed algorithm surpasses the exact method in terms of objective value and computational time.

Sign in / Sign up

Export Citation Format

Share Document