241
Views
20
CrossRef citations to date
0
Altmetric
Original Articles

Scheduling identical wafer sorting parallel machines with sequence-dependent setup times using an iterated greedy heuristic

Pages 2710-2719 | Received 18 Aug 2010, Accepted 09 May 2011, Published online: 11 Jul 2011

References

  • Baraz , D and Mosheiov , G . 2008 . A note on a greedy heuristic for flow-shop makespan minimisation with no machine idle-time . European Journal of Operational Research , 184 ( 2 ) : 810 – 813 .
  • Blum , C and Roli , A . 2003 . Metaheuristics in combinatorial optimisation: overview and conceptual comparison . ACM Computing Surveys , 35 ( 3 ) : 268 – 308 .
  • Chen , TR . 1995 . Scheduling for IC sort and test with preemptiveness via Lagrangian relaxation . IEEE Transactions on Systems, Man, and Cybernetics , 25 ( 8 ) : 1249 – 1256 .
  • Chiang , TC , Shen , YS and Fu , LC . 2008 . A new paradigm for rule-based scheduling in the wafer probe centre . International Journal of Production Research , 46 ( 15 ) : 4111 – 4133 .
  • Cotta , C and van Hemert , J . 2008 . Recent advances in evolutionary computation for combinatorial optimisation , Berlin : Springer .
  • Ellis , KP , Lu , Y and Bish , EK . 2004 . Scheduling of wafer test processes in semiconductor manufacturing . International Journal of Production Research , 42 ( 2 ) : 215 – 242 .
  • Gendreau , M and Potvin , JY . 2005 . Metaheuristics in combinatorial optimisation . Annals of Operations Research , 140 ( 1 ) : 189 – 213 .
  • Jacobs , LW and Brusco , MJ . 1995 . A local-search heuristic for large set-covering problems . Naval Research Logistics Quarterly , 42 ( 7 ) : 1129 – 1140 .
  • Lin , JT , Wang , FK and Lee , WT . 2004 . Capacity-constrained scheduling for a logic IC final test facility . International Journal of Production Research , 42 ( 1 ) : 79 – 99 .
  • Lin , SW . 2011 . Meta-heuristic algorithms for wafer sorting scheduling problems . Journal of the Operational Research Society , 62 ( 1 ) : 165 – 174 .
  • Lin , SW , Ying , KC and Lee , ZJ . 2009 . Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times . Computers & Operations Research , 36 ( 4 ) : 1110 – 1121 .
  • Marchiori , E and Steenbeek , A . 2000 . An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling . Lecture Notes in Computer Science , 1803 : 370 – 384 .
  • Ovacik , IM and Uzsoy , R . 1996 . Decomposition methods for scheduling semiconductor testing facilities . International Journal of Flexible Manufacturing Systems , 8 ( 4 ) : 357 – 387 .
  • Pearn , WL , Chung , SH and Yang , MH . 2002a . The wafer probing scheduling problem (WPSP) . Journal of the Operational Research Society , 53 ( 8 ) : 864 – 874 .
  • Pearn , WL , Chung , SH and Yang , MH . 2002b . Minimising the total machine workload for the wafer probing scheduling problem (WPSP) . IIE Transactions , 34 ( 2 ) : 211 – 220 .
  • Pearn , WL , Chung , SH and Yang , MH . 2002c . A case study on the wafer probing scheduling problem . Production Planning & Control , 13 ( 1 ) : 66 – 75 .
  • Pearn , WL . 2004 . Algorithms for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions . Journal of the Operational Research Society , 55 ( 11 ) : 1194 – 1207 .
  • Pearn , WL . 2008 . Solution strategies for multi-stage wafer probing scheduling problem with reentry . Journal of the Operational Research Society , 59 ( 5 ) : 637 – 651 .
  • Ruiz , R and Stützle , T . 2007 . A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem . European Journal of Operational Research , 177 ( 3 ) : 2033 – 2049 .
  • Ruiz , R and Stützle , T . 2008 . An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives . European Journal of Operational Research , 187 ( 3 ) : 1143 – 1159 .
  • Shim , SO and Kim , YD . 2008 . A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property . Computers & Operations Research , 35 ( 3 ) : 863 – 875 .
  • Ullman , JD . 1975 . NP-complete scheduling problem . Journal of Computer and System Sciences , 10 ( 3 ) : 384 – 393 .
  • Uzsoy , R , Lee , CY and Martin-Vega , LA . 1992 . A review of production planning and scheduling models in the semiconductor industry part I: system characteristics, performance evaluation and production planning . IIE Transactions , 24 ( 4 ) : 47 – 60 .
  • Yang , J and Chang , TS . 1998 . Multiobjective scheduling for IC sort and test with a simulation test bed . IEEE Transactions on Semiconductor Manufacturing , 11 ( 2 ) : 304 – 315 .
  • Ying , KC and Cheng , HM . 2010 . Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic . Expert Systems with Applications , 37 ( 4 ) : 2848 – 2852 .
  • Ying , KC and Liao , CJ . 2004 . An ant colony system for permutation flow-shop sequencing . Computers & Operations Research , 31 ( 5 ) : 791 – 801 .
  • Ying , KC . 2008 . Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic . The International Journal of Advanced Manufacturing Technology , 38 ( 3–4 ) : 348 – 354 .
  • Ying , KC . 2009 . An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks . Journal of the Operational Research Society , 60 ( 6 ) : 810 – 817 .
  • Ying , KC , Lin , SW and Huang , CY . 2009 . Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic . Expert Systems with Applications , 36 ( 3 ) : 7087 – 7092 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.