An approximation algorithm for scheduling on three dedicated machinesGOEMANS, M. X.Discrete applied mathematics. 1995, Vol 61, Num 1, pp 49-59, issn 0166-218XArticle

Optimal on-line algorithms to minimize makespan on two machines with resource augmentationEPSTEIN, Leah; GANOT, Arik.Lecture notes in computer science. 2004, pp 109-122, issn 0302-9743, isbn 3-540-21079-2, 14 p.Conference Paper

On a relation between some nonpreemptive, parallel machine scheduling problemsWEGLARZ, J.Bulletin of the Polish Academy of Sciences. Technical sciences. 1992, Vol 40, Num 4, pp 411-416, issn 0239-7528Article

Efficient implementation of Johnson's rule for the n/2/F/F_max scheduling problemCHENG, T. C. E.Computers & industrial engineering. 1992, Vol 22, Num 4, pp 495-499, issn 0360-8352Article

An application of genetic algorithms for flow shop problemsCHUEN-LUNG CHEN; VEMPATI, V. S; ALJABER, N et al.European journal of operational research. 1995, Vol 80, Num 2, pp 389-396, issn 0377-2217Article

Preemptive on-line scheduling for two uniform processorsJIANJUN WEN; DONGLEI DU.Operations research letters. 1998, Vol 23, Num 3-5, pp 113-116, issn 0167-6377Article

Scheduling uniform machines on-line requires nondecreasing speed ratios : Sequencing and schedulingVESTJENS, A. P. A.Mathematical programming. 1998, Vol 82, Num 1-2, pp 225-234, issn 0025-5610Article

On-line scheduling of multi-core processor tasks with virtualizationDESHI YE; GUOCHUAN ZHANG.Operations research letters. 2010, Vol 38, Num 4, pp 307-311, issn 0167-6377, 5 p.Article

Utilization of nonclairvoyant online schedulesMOHAMED EID HUSSEIN; SCHWIEGELSHOHN, Uwe.Theoretical computer science. 2006, Vol 362, Num 1-3, pp 238-247, issn 0304-3975, 10 p.Article

Minimizing the total completion time on-line on a single machine, using restartsVAN STEE, Rob; LA POUTRE, Han.Lecture notes in computer science. 2002, pp 872-883, issn 0302-9743, isbn 3-540-44180-8, 12 p.Conference Paper

Sequencing with uncertain numerical data for make span minimisationLAI, T.-C; SOTSKOV, Y. N.The Journal of the Operational Research Society. 1999, Vol 50, Num 3, pp 230-243, issn 0160-5682Article

Stochastically minimizing the makespan in two-machine flow shops without blockingKAMBUROWSKI, J.European journal of operational research. 1999, Vol 112, Num 2, pp 304-309, issn 0377-2217Article

An evaluation of sequencing heuristics in flow shops with multiple processorsSANTOS, D. L; HUNSUCKER, J. L; DEAL, D. E et al.Computers & industrial engineering. 1996, Vol 30, Num 4, pp 681-691, issn 0360-8352Article

A genetic algorithm for family and job scheduling in a flowline-based manufacturing cellJAGABANDHU SRIDHAR; CHANDRASEKHARAN RAJENDRAN.Computers & industrial engineering. 1994, Vol 27, Num 1-4, pp 469-472, issn 0360-8352Conference Paper

An improved formulation for the job-shop scheduling problemCHING-JONG LIAO; CHII-TSUEN YOU.The Journal of the Operational Research Society. 1992, Vol 43, Num 11, pp 1047-1054, issn 0160-5682Article

An experimental study of online scheduling algorithmsALBERS, Susanne; SCHRÖDER, Bianca.Lecture notes in computer science. 2001, pp 11-22, issn 0302-9743, isbn 3-540-42512-8Conference Paper

New results on flow time with resource augmentationEPSTEIN, Leah; VAN STEE, Rob.Report - Software engineering. 2000, Num 28, pp 1-12, issn 1386-369XArticle

The multiple resource constrained project scheduling problem : A breadth-first approachNAZARETH, T; VERMA, S; BHATTACHARYA, S et al.European journal of operational research. 1999, Vol 112, Num 2, pp 347-366, issn 0377-2217Article

A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setupsLEE, H; GUIGNARD, M.The Journal of the Operational Research Society. 1996, Vol 47, Num 10, pp 1247-1261, issn 0160-5682Article

Scheduling workers in a constricted areaBRIMBERG, J; HURLEY, W. J; WRIGHT, R. E et al.Naval research logistics. 1996, Vol 43, Num 1, pp 143-149, issn 0894-069XArticle

Design of components for schedulabilityKUSIAK, A; WEIHUA HE.European journal of operational research. 1994, Vol 76, Num 1, pp 49-59, issn 0377-2217Article

Batching and scheduling in FMS hubs : flow time considerationsLANE, D. E; SIDNEY, J. B.Operations research. 1993, Vol 41, Num 6, pp 1091-1103, issn 0030-364XArticle

Contention resolution with heterogeneous job sizesBENDER, Michael A; FINEMAN, Jeremy T; GILBERT, Seth et al.Lecture notes in computer science. 2006, pp 112-123, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

A two-stage hybrid flowshop with uniform machines and setup timesHUANG, W; LI, S.Mathematical and computer modelling. 1998, Vol 27, Num 2, pp 27-45, issn 0895-7177Article

The stochastic flowshop makespan : some further resultsMIDDLETON, D.International journal of production research. 1996, Vol 34, Num 3, pp 889-893, issn 0020-7543Article