Algorithms for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions

W L Pearn; S H Chung; M H Yang; Y H Chen

doi:10.1057/palgrave.jors.2601795

Algorithms for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions

Journal of the Operational Research Society ◽

10.1057/palgrave.jors.2601795 ◽

2004 ◽

Vol 55 (11) ◽

pp. 1194-1207 ◽

Cited By ~ 14

Author(s):

W L Pearn ◽

S H Chung ◽

M H Yang ◽

Y H Chen

Keyword(s):

Scheduling Problem ◽

Due Date ◽

Sequence Dependent ◽

Wafer Probing ◽

Set Up

Download Full-text

A novel hybrid SA/GA algorithm for solving an integrated cell formation–job scheduling problem with sequence-dependent set-up times

International Journal of Management Science and Engineering Management ◽

10.1080/17509653.2014.1003109 ◽

2015 ◽

Vol 11 (3) ◽

pp. 134-142 ◽

Cited By ~ 1

Author(s):

Hamed Rafiei ◽

Masoud Rabbani ◽

Hassan Gholizadeh ◽

Hossein Dashti

Keyword(s):

Job Scheduling ◽

Cell Formation ◽

Scheduling Problem ◽

Sequence Dependent ◽

Ga Algorithm ◽

Job Scheduling Problem ◽

Set Up

Download Full-text

Variable neighborhood search with memory for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times

Knowledge-Based Systems ◽

10.1016/j.knosys.2018.01.018 ◽

2018 ◽

Vol 145 ◽

pp. 236-249 ◽

Cited By ~ 12

Author(s):

Joaquín Pacheco ◽

Santiago Porras ◽

Silvia Casado ◽

Bruno Baruque

Keyword(s):

Single Machine ◽

Variable Neighborhood Search ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Neighborhood Search ◽

Scheduling Problem ◽

Sequence Dependent ◽

Periodic Maintenance ◽

Set Up ◽

With Memory

Download Full-text

A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times

Journal of Industrial Engineering International ◽

10.1186/2251-712x-8-26 ◽

2012 ◽

Vol 8 (1) ◽

Cited By ~ 16

Author(s):

Aref Maleki-Darounkolaei ◽

Mahmoud Modiri ◽

Reza Tavakkoli-Moghaddam ◽

Iman Seyyedi

Keyword(s):

Flow Shop ◽

Flow Shop Scheduling ◽

Scheduling Problem ◽

Shop Scheduling ◽

Sequence Dependent ◽

Set Up

Download Full-text

A multi-start tabu search method for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times

Journal of Scheduling ◽

10.1007/s10951-012-0280-2 ◽

2012 ◽

Vol 16 (6) ◽

pp. 661-673 ◽

Cited By ~ 13

Author(s):

Joaquín Pacheco ◽

Francisco Ángel-Bello ◽

Ada Álvarez

Keyword(s):

Tabu Search ◽

Single Machine ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Search Method ◽

Scheduling Problem ◽

Sequence Dependent ◽

Periodic Maintenance ◽

Tabu Search Method ◽

Set Up

Download Full-text

Distributed assembly permutation flow-shop scheduling problem with sequence-dependent set-up times using a novel biogeography-based optimization algorithm

Engineering Optimization ◽

10.1080/0305215x.2021.1886289 ◽

2021 ◽

pp. 1-21

Author(s):

Jialin Huang ◽

Xingsheng Gu

Keyword(s):

Optimization Algorithm ◽

Flow Shop ◽

Flow Shop Scheduling ◽

Scheduling Problem ◽

Shop Scheduling ◽

Permutation Flow Shop Scheduling ◽

Sequence Dependent ◽

Permutation Flow Shop ◽

Set Up ◽

Distributed Assembly

Download Full-text

A production scheduling problem with uncertain sequence-dependent set-up times and random yield

International Journal of Production Research ◽

10.1080/00207543.2014.998790 ◽

2015 ◽

Vol 53 (9) ◽

pp. 2820-2835 ◽

Cited By ~ 1

Author(s):

Byung Jun Joo ◽

Paul Xirouchakis

Keyword(s):

Production Scheduling ◽

Scheduling Problem ◽

Random Yield ◽

Sequence Dependent ◽

Set Up

Download Full-text

Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs

Computers & Operations Research ◽

10.1016/j.cor.2007.04.003 ◽

2008 ◽

Vol 35 (11) ◽

pp. 3644-3656 ◽

Cited By ~ 65

Author(s):

Patrizia Beraldi ◽

Gianpaolo Ghiani ◽

Antonio Grieco ◽

Emanuela Guerriero

Keyword(s):

Lot Sizing ◽

Parallel Machine ◽

Scheduling Problem ◽

Rolling Horizon ◽

Sequence Dependent ◽

Set Up ◽

Lot Sizing And Scheduling

Download Full-text

A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time

Computers & Operations Research ◽

10.1016/s0305-0548(03)00117-5 ◽

2004 ◽

Vol 31 (10) ◽

pp. 1727-1751 ◽

Cited By ~ 48

Author(s):

Ghaith Rabadi ◽

Mansooreh Mollaghasemi ◽

Georgios C. Anagnostopoulos

Keyword(s):

Branch And Bound ◽

Machine Scheduling ◽

Setup Time ◽

Branch And Bound Algorithm ◽

Scheduling Problem ◽

Due Date ◽

Common Due Date ◽

Sequence Dependent ◽

Sequence Dependent Setup Time ◽

Sequence Dependent Setup

Download Full-text

Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows

European Journal of Operational Research ◽

10.1016/s0377-2217(96)00020-3 ◽

1997 ◽

Vol 100 (3) ◽

pp. 494-513 ◽

Cited By ~ 47

Author(s):

Marc Salomon ◽

Marius M. Solomon ◽

Luk N. Van Wassenhove ◽

Yvan Dumas ◽

Stephane Dauzère-Pérès

Keyword(s):

Travelling Salesman Problem ◽

Time Windows ◽

Scheduling Problem ◽

Travelling Salesman ◽

Sequence Dependent ◽

Set Up ◽

Lotsizing And Scheduling

Download Full-text

A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times

Journal of the Operational Research Society ◽

10.1057/palgrave.jors.2602020 ◽

2006 ◽

Vol 57 (5) ◽

pp. 541-551 ◽

Cited By ~ 16

Author(s):

F T Tseng ◽

J N D Gupta ◽

E F Stafford

Keyword(s):

Heuristic Algorithm ◽

Scheduling Problem ◽

Flowshop Scheduling ◽

Permutation Flowshop ◽

Sequence Dependent ◽

Set Up ◽

Flowshop Scheduling Problem

Download Full-text