Advanced search
Publication Cover
International Journal of Production Research Volume 49, 2011 - Issue 2
Submit an article Journal homepage
287
Views
28
CrossRef citations to date
0
Altmetric
Original Articles

Variable neighbourhood search for minimising tardiness objectives on flow shop with batch processing machines

Deming Lei School of Automation, Wuhan University of Technology, Hubei Province, PR ChinaCorrespondence[email protected]
&
Xiu Ping Guo School of Economic and Management, Southwest Jiaotong University, Chengdu, Sichuan Province, PR China
Pages 519-529 | Received 09 Jun 2009, Accepted 03 Dec 2009, Published online: 03 Mar 2010

References

  • Damodaran , P , Menjeshwar , PK and Srihari , K . 2006 . Minimising makespan on a batch-processing machine with non-identical job sizes using genetic algorithms . International Journal of Production Economics , 103 ( 2 ) : 882 – 891 .
  • Damodaran , P , Srihari , K and Lam , SS . 2007 . Scheduling a capacitated batch-processing machine to minimise makespan . Robot Computer Integrated Manufacture , 23 ( 2 ) : 208 – 216 .
  • Geiger , CD and Uzsoy , R . 2008 . Learning effective dispatching rules for batch processor scheduling . International Journal of Production Research , 46 ( 15 ) : 1431 – 1454 .
  • Goldberg , D and Lingle , R . 1985 . Alleles, loci and the traveling salesman problem . Proceedings of the 1st international conference on genetic algorithms . 1985 , Pittsburg, Pennsylvania. Lawrence Erlbaum Associates, 154–159
  • Hansen , P and Mladenovíc , N . 2001 . Variable neighborhood search: principles and applications . European Journal of Operational Research , 130 ( 3 ) : 449 – 467 .
  • Kashan , AH , Karimi , B and Jenabi , M . 2008 . A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes . Computers and Operations Research , 35 ( 4 ) : 1084 – 1098 .
  • Koh , S-C . 2005 . Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families . International Journal of Production Economics , 98 ( 1 ) : 81 – 96 .
  • Kytöjoki , J . 2007 . An efficient variable neighborhood search heuristic for very large vehicle routing problems . Computers and Operations Research , 34 ( 9 ) : 2743 – 2757 .
  • Liao , C-J and Cheng , C-C . 2007 . A variable neighborhood search for minimising single machine weighted earliness and tardiness with common due date . Computers and Industrial Engineering , 52 ( 4 ) : 404 – 413 .
  • Li , CL and Lee , CY . 1997 . Scheduling with agreeable release times and due dates on a batch processing machines . European Journal of Operational Research , 96 ( 3 ) : 546 – 569 .
  • Malve , S and Uzsoy , R . 2007 . A genetic algorithm for minimising maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families . Computers and Operations Research , 34 ( 10 ) : 3016 – 3028 .
  • Manjeshwar , PK , Damodaran , P and Srihari , K . 2004 . Minimising makespan in a flow shop with two batch-processing machines using simulated annealing . Robot Computer Integrated Manufacture , 25 ( 3 ) : 667 – 679 .
  • Melouk , S , Damodaran , P and Chang , P-Y . 2004 . Minimising makespan for single machine batch processing with non-identical job sizes using simulated annealing . International Journal of Production Economics , 87 ( 2 ) : 141 – 147 .
  • Wang , C-S and Uzsoy , R . 2002 . A genetic algorithm to minimise maximum lateness on a batch processing machine . Computers and Operations Research , 29 ( 12 ) : 1621 – 1640 .
  • Yimer , AD and Demirli , K . 2009 . Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines . International Journal of Approach to REA , 50 ( 1 ) : 117 – 137 .

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.