Minimizing Makespan on Identical Parallel Machines

E-ISSN： 1947-9336|6|1|19-29

ISSN： 1947-9328

Source： International Journal of Operations Research and Information Systems (IJORIS), Vol.6, Iss.1, 2015-01, pp. : 19-29

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

An Efficient Approach for the Reentrant Parallel Machines Scheduling Problem under Consumable Resources Constraints

International Journal of Information Systems and Supply Chain Management (IJISSCM), Vol. 9, Iss. 3, 2016-07 ,pp. : 1-25

IGI Global_journal

Access to resources Recommend Favorite

A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria

By Framinan Jose

OR Spectrum, Vol. 30, Iss. 4, 2008-10 ,pp. : 787-804

Springer Publishing Company

Access to resources Recommend Favorite

Minimizing Competition? Entry-Level Compensation in Japanese Firms

By Yanadori Yoshio

Asia Pacific Journal of Management, Vol. 21, Iss. 4, 2004-12 ,pp. : 445-467

Springer Publishing Company

Access to resources Recommend Favorite

A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub

By Han Yongbin

OR Spectrum, Vol. 30, Iss. 4, 2008-10 ,pp. : 697-720

Springer Publishing Company

Access to resources Recommend Favorite

Minimizing transportation costs: An efficient and effective approach for the spreadsheet user

By Parker Brian J. Caine David J.

Transport Logistics, Vol. 1, Iss. 2, 1997-06 ,pp. : 129-137

VSP

Access to resources Recommend Favorite