Strongly Fully Polynomial Time Approximation Scheme for the two-parallel capacitated machines scheduling problem

Author： Kacem Imed  

Publisher： Inderscience Publishers

ISSN： 2044-494X

Source： International Journal of Planning and Scheduling, Vol.1, Iss.1-2, 2011-12, pp. : 32-41

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

A scheduling problem with unrelated parallel machines and sequence dependent setups

By Ravetti M. Gomez   Mateus Geraldo R.   Rocha Pedro L.   Pardalos Panos M.  

International Journal of Operational Research, Vol. 2, Iss. 4, 2007-06 ,pp. : 380-399

Inderscience Publishers

Access to resources Recommend Favorite

A Deterministic Maintenance-scheduling Problem for a Group of Non-identical Machines

By Hariga Moncer  

International Journal of Operations & Production Management, Vol. 14, Iss. 7, 1994-07 ,pp. : 27-36

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

A shifting bottleneck approach for a parallel-machine flowshop scheduling problem

By Cheng J.   Karuno Y.   Kise H.  

Journal of the Operations Research Society of Japan, Vol. 44, Iss. 2, 2001-06 ,pp. : 140-156

Elsevier

Access to resources Recommend Favorite

Parallel branch-and-bound and parallel PSO algorithms for job shop scheduling problem with blocking

By AitZai Abdelhakim   Boudhar Mourad  

International Journal of Operational Research, Vol. 16, Iss. 1, 2013-11 ,pp. : 14-37

Inderscience Publishers

Access to resources Recommend Favorite

On solving the Capacitated Hub Routing Problem

By Kumar P.N. Ram   Sivakumar Appa Iyer  

International Journal of Logistics Systems and Management, Vol. 8, Iss. 4, 2011-04 ,pp. : 392-402

Inderscience Publishers

Access to resources Recommend Favorite