341
Views
17
CrossRef citations to date
0
Altmetric
Original Articles

A multi-agent-based negotiation approach for parallel machine scheduling with multi-objectives in an electro-etching process

&
Pages 5719-5733 | Received 12 Sep 2010, Accepted 11 Aug 2011, Published online: 29 Sep 2011

References

  • Adamopoulos , GI and Pappis , CP . 1998 . Scheduling under a common due-data on parallel unrelated machines . European Journal of Operational Research , 105 ( 3 ) : 494 – 501 .
  • Allahverdi , A . 2008 . A survey of scheduling problems with set-up times or costs . European Journal of Operational Research , 187 ( 3 ) : 985 – 1032 .
  • Bank , J and Werner , F . 2001 . Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties . Mathematical and Computer Modelling , 33 ( 4–5 ) : 363 – 383 .
  • Chen , JF and Wu , TH . 2006 . Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints . Omega , 34 ( 1 ) : 81 – 89 .
  • Cheng , TCE and Sin , CCS . 1990 . A state-of-the-art review of parallel-machine scheduling research . European Journal of Operational Research , 47 ( 3 ) : 271 – 292 .
  • Chuang , MC , Liao , CJ and Chao , CW . 2010 . Parallel machine scheduling with preference of machines . International Journal of Production Research , 48 ( 14 ) : 4139 – 4152 .
  • Cochran , JK , Horng , SM and Fowler , JW . 2003 . A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines . Computers & Operations Research , 30 ( 7 ) : 1087 – 1102 .
  • Dessouky , MM . 1998 . Scheduling identical jobs with unequal ready time on uniform parallel machines to minimize the maximum lateness . Computers and Industrial Engineering , 34 ( 4 ) : 793 – 806 .
  • Dunstall , S and Wirth , A . 2005a . A comparison of branch- and-bound algorithms for a family scheduling problem with identical parallel machines . European Journal of Operational Research , 167 ( 2 ) : 283 – 296 .
  • Dunstall , S and Wirth , A . 2005b . Heuristic methods for the identical parallel machine flowtime problem with set-up times . Computers and Operations Research , 32 ( 9 ) : 2479 – 2491 .
  • Fanjul-Peyro , L and Ruiz , R . 2010 . Iterated greedy local search methods for unrelated parallel machine scheduling . European Journal of Operational Research , 207 ( 1 ) : 55 – 69 .
  • Fanjul-Peyro , L and Ruiz , R . 2011 . Size-reduction heuristics for the unrelated parallel machines scheduling problem . Computers and Operations Research , 38 ( 1 ) : 301 – 309 .
  • FIPA, 2011. FIPA ACL Message Structure Specification/FIPA Ontology Service Specification. Available at: http://www.fipa.org/repository/aclspecs.html
  • Ghirardi , M and Potts , CN . 2005 . Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach . European Journal of Operational Research , 165 ( 2 ) : 457 – 467 .
  • JADE, 2011. Available at: http://jade.tilab.com
  • Kim , DW . 2002 . Unrelated parallel machine scheduling with set-up times using simulated annealing . Robotics and Computer-Integrated Manufacturing , 18 ( 3–4 ) : 223 – 231 .
  • Kim , DW , Na , DG and Frank , CF . 2003 . Unrelated parallel machine scheduling with set-up times and a total weighted tardiness objective . Robotics and Computer-Integrated Manufacturing , 19 ( 1–2 ) : 173 – 181 .
  • Koulamas , C and Kyparisis , GJ . 2000 . Scheduling on uniform parallel machines to minimize maximum lateness . Operations Research Letters , 26 ( 4 ) : 175 – 179 .
  • Koulamas , C and Kyparisis , GJ . 2004 . Makespan minimization on uniform parallel machines with release times . European Journal of Operational Research , 157 ( 1 ) : 262 – 266 .
  • Lancia , G . 2000 . Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan . European Journal of Operational Research , 120 ( 2 ) : 277 – 288 .
  • Leung , CW . 2010 . Integrated process planning and scheduling by an agent-based ant colony optimization . Computers and Industrial Engineering , 59 ( 1 ) : 166 – 180 .
  • Liaw , CF . 2003 . Scheduling unrelated parallel machines to minimize total weighted tardiness . Computers and Operations Research , 30 ( 12 ) : 1777 – 1789 .
  • Logendran , R , McDonell , B and Byran , S . 2007 . Scheduling unrelated parallel machines with sequence-dependent set-ups . Computers and Operations Research , 34 ( 11 ) : 3420 – 3438 .
  • Loukil , T , Teghem , J and Tuyttens , D . 2005 . Solving multi-objective production scheduling problems using metaheuristics . European Journal of Operational Research , 161 ( 1 ) : 42 – 61 .
  • Low , C . 2005 . Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines . Computers and Operations Research , 32 ( 8 ) : 2013 – 2025 .
  • Martello , S , Soumis , F and Toth , P . 1997 . Exact and approximation algorithms for makespan minimization on unrelated parallel machines . Discrete Applied Mathematics , 75 ( 2 ) : 169 – 188 .
  • Mokotoff , E . 2001 . Parallel machine scheduling problems: a survey . Asia-Pacific Journal of Operational Research , 18 ( 2 ) : 193 – 242 .
  • Piersma , N and van Dijk , W . 1996 . A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search . Mathematical and Computer Modelling , 24 ( 9 ) : 11 – 19 .
  • Plateau , MC and Rios-Solis , YA . 2010 . Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations . European Journal of Operational Research , 201 ( 3 ) : 729 – 736 .
  • Rocha , PL . 2008 . Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent set-up times . Computers and Operations Research , 35 ( 4 ) : 1250 – 1264 .
  • Silva , C and Magalhaes , JM . 2006 . Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry . Computers and Industrial Engineering , 50 ( 1–2 ) : 76 – 89 .
  • Suresh , V and Chaudhuri , D . 1996 . Bicriteria scheduling problem for unrelated parallel machines . Computers and Industrial Engineering , 30 ( 1 ) : 77 – 82 .
  • T'kindt , V , Billaut , JC and Proust , C . 2001 . Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry . European Journal of Operational Research , 135 ( 1 ) : 42 – 49 .
  • Weng , MX , Lu , J and Ren , H . 2001 . Unrelated parallel machine scheduling with set-up consideration and a total weighted completion time objective . International Journal of Production Economics , 70 ( 3 ) : 215 – 226 .
  • Wong , TN . 2006a . An agent-based negotiation approach to integrate process planning and scheduling . International Journal of Production Research , 44 ( 7 ) : 1331 – 1351 .
  • Wong , TN . 2006b . Integrating process planning and scheduling/rescheduling: an agent-based approach . International Journal of Production Research , 44 ( 18–19 ) : 3627 – 3655 .
  • Yokoyama , K . Morikawa, K., and Takahashi, K., 2006. A multi-agent system for assembly line balancing. Proceedings of the Eighth International Conference on Industrial Management, Qingdao, China
  • Yokoyama , K . Morikawa, K., and Takahashi, K., 2007. A multi-agent system for stochastic assembly line balancing. The 8th Asia Pacific Industrial Engineering & Management System and Chinese Institute of Industrial Engineers Conference (APIEMS & CIIE Conference), Taiwan, 9–12 December
  • Yokoyama , K . Morikawa, K., and Takahashi, K., 2008. A multi-agent system for mixed-model assembly line balancing. The 9th Asia Pacific Industrial Engineering & Management Systems Conference (APIEMS) and the 11th Asia Pacific Regional Meeting of the International Foundation for Production Research, Nusa Dua, Bali, 3–5 December
  • Zhang , YF , Saravanan , AN and Fuh , JYH . 2003 . Integration of process planning and scheduling by exploring the flexibility of process planning . International Journal of Production Research , 41 ( 3 ) : 611 – 628 .

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.