Batch scheduling on parallel machines with dynamic job arrivals and incompatible job families

By Cakici Eray  

International Journal of Production Research, Vol. 51, Iss. 8, 2013-04 ,pp. : 2462-2477

Taylor & Francis Ltd

Access to resources Recommend Favorite

A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date

By Webster S.   Jog D.   Gupta A.  

International Journal of Production Research, Vol. 36, Iss. 9, 1998-09 ,pp. : 2543-2551

Taylor & Francis Ltd

Access to resources Recommend Favorite

Scheduling parallel machines to minimize weighted flowtime with family set-up times

By Azizoglu M.  

International Journal of Production Research, Vol. 41, Iss. 6, 2003-01 ,pp. : 1199-1215

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solving parallel machines job-shop scheduling problems by an adaptive algorithm

By Gholami Omid   Sotskov Yuri N.  

International Journal of Production Research, Vol. 52, Iss. 13, 2014-07 ,pp. : 3888-3904

Taylor & Francis Ltd

Access to resources Recommend Favorite

Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers

By Rajendran C.  

International Journal of Production Research, Vol. 37, Iss. 5, 1999-03 ,pp. : 1137-1158

Taylor & Francis Ltd

Access to resources Recommend Favorite