Minimising makespan for a two-machine, flow shop, single-wafer-processing, multiple-jobs-per-carrier scheduling problem

Author： Sarin Subhash C.  

Publisher： Inderscience Publishers

ISSN： 2044-494X

Source： International Journal of Planning and Scheduling, Vol.1, Iss.3, 2012-10, pp. : 171-208

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Makespan distributions in flow shop scheduling

By Caffrey James   Hitchings Graham  

International Journal of Operations & Production Management, Vol. 15, Iss. 3, 1995-03 ,pp. : 50-58

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Minimising a weighted quadratic function of job lateness in the stochastic single machine scheduling problem

By Soroush H.M.   Alqallaf F.A.  

International Journal of Operational Research, Vol. 6, Iss. 4, 2009-07 ,pp. : 538-572

Inderscience Publishers

Access to resources Recommend Favorite

Agility in two-stage hybrid flow shop parallel machine scheduling through simulated annealing

By Arumugam C.   Raja K.   Selladurai V.  

International Journal of Services and Operations Management, Vol. 3, Iss. 3, 2007-04 ,pp. : 332-354

Inderscience Publishers

Access to resources Recommend Favorite

Simulated annealing and imperialist competitive algorithm for minimising makespan in an open shop

By Jolai Fariborz   Goldansaz Seyed Morteza   Zahedi-Anaraki Amir Hossein  

International Journal of Operational Research, Vol. 17, Iss. 3, 2013-06 ,pp. : 275-294

Inderscience Publishers

Access to resources Recommend Favorite

Improved heuristically guided genetic algorithm for the flow shop scheduling problem

By Laha Dipak   Mandal Purnendu  

International Journal of Services and Operations Management, Vol. 3, Iss. 3, 2007-04 ,pp. : 316-331

Inderscience Publishers

Access to resources Recommend Favorite