Sequencing jobs that require common resources on a single machine: A solvable case of the TSP

By A.A. van der Veen J.   Woeginger G.J.   Zhang S.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 235-254

Elsevier

Access to resources Recommend Favorite

Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs

By Brucker Peter   Kravchenko Svetlana  

Journal of Mathematical Modelling and Algorithms, Vol. 5, Iss. 2, 2006-06 ,pp. : 143-165

Springer Publishing Company

Access to resources Recommend Favorite

Semi-online scheduling for jobs with release times

By Li Rongheng   Yang Liying   He Xiaoqiong   Chen Qiang   Cheng Xiayan  

Journal of Combinatorial Optimization, Vol. 26, Iss. 3, 2013-10 ,pp. : 448-464

Springer Publishing Company

Access to resources Recommend Favorite

Scheduling Equal-Length Jobs with Delivery times on Identical Processors

By Vakhania Nodari  

International Journal of Computer Mathematics, Vol. 79, Iss. 6, 2002-01 ,pp. : 715-728

Taylor & Francis Ltd

Access to resources Recommend Favorite

Preemptive scheduling of equal-length jobs to maximize weighted throughput

By Baptiste P.   Chrobak M.   Durr C.   Jawor W.   Vakhania N.  

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 258-264

Elsevier

Access to resources Recommend Favorite