Input control and dispatching rules in a dynamic CONWIP flow-shop

By Framinan J. M.   Ruiz-Usano R.   Leisten R.  

International Journal of Production Research, Vol. 38, Iss. 18, 2000-12 ,pp. : 4589-4598

Taylor & Francis Ltd

Access to resources Recommend Favorite

System capacity and performance modelling of finite buffer queueing networks

By Smith J. MacGregor  

International Journal of Production Research, Vol. 52, Iss. 11, 2014-06 ,pp. : 3125-3163

Taylor & Francis Ltd

Access to resources Recommend Favorite

Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs

By Ozlen Melih  

International Journal of Production Research, Vol. 48, Iss. 1, 2010-01 ,pp. : 201-226

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

Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem

By Framinan J.M.  

International Journal of Production Research, Vol. 41, Iss. 1, 2003-01 ,pp. : 121-148

Taylor & Francis Ltd

Access to resources Recommend Favorite