Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruptionJINJIANG YUAN; YUNDONG MU.European journal of operational research. 2007, Vol 182, Num 2, pp 936-944, issn 0377-2217, 9 p.Article

Trading off between makespan and customer responsiveness in flow shop sequencingCOHN, Amy; KURNAZ, Selin; YIHAN GUAN et al.International journal of production research. 2010, Vol 48, Num 21-22, pp 6777-6797, issn 0020-7543, 21 p.Article

Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithmLIN, Shih-Wei; YING, Kuo-Ching.Computers & operations research. 2013, Vol 40, Num 6, pp 1625-1647, issn 0305-0548, 23 p.Article

Single-machine group scheduling problems with deterioration considerationWU, Chin-Chia; SHIAU, Yau-Ren; LEE, Wen-Chiung et al.Computers & operations research. 2008, Vol 35, Num 5, pp 1652-1659, issn 0305-0548, 8 p.Article

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

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

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

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

Johnson's rule, composite jobs and the relocation problemCHENG, T. C. E; LIN, B. M. T.European journal of operational research. 2009, Vol 192, Num 3, pp 1008-1013, issn 0377-2217, 6 p.Article

Cooperative metaheuristics for the permutation flowshop scheduling problemVALLADA, Eva; RUIZ, Rubén.European journal of operational research. 2009, Vol 193, Num 2, pp 365-376, issn 0377-2217, 12 p.Article

Differential evolution for solving multi-mode resource-constrained project scheduling problemsDAMAK, N; JARBOUI, B; SIARRY, P et al.Computers & operations research. 2009, Vol 36, Num 9, pp 2653-2659, issn 0305-0548, 7 p.Article

Online scheduling of equal-processing-time task systemsYUMEI HUO; LEUNG, Joseph Y.-T; XIN WANG et al.Theoretical computer science. 2008, Vol 401, Num 1-3, pp 85-95, issn 0304-3975, 11 p.Article

Flow shop-sequencing problem with synchronous transfers and makespan minimizationSOYLU, B; KIRCA, O; AZIZOGLU, M et al.International journal of production research. 2007, Vol 45, Num 15, pp 3311-3331, issn 0020-7543, 21 p.Article

Bicriteria scheduling in a two-machine permutation flowshopLIN, B. M. T; WU, J. M.International journal of production research. 2006, Vol 44, Num 12, pp 2299-2312, issn 0020-7543, 14 p.Article

Hierarchical minimization of completion time variance and makespan in jobshopsVISWANATH KUMAR GANESAN; APPA IYER SIVAKUMAR; SRINIVASAN, G et al.Computers & operations research. 2006, Vol 33, Num 5, pp 1345-1367, issn 0305-0548, 23 p.Article

Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplicationBASKIYAR, Sanjeev; DICKINSON, Christopher.Journal of parallel and distributed computing (Print). 2005, Vol 65, Num 8, pp 911-921, issn 0743-7315, 11 p.Article

A new bounding mechanism for the CNC machine scheduling problems with controllable processing timesKAYAN, Rabia K; AKTURK, M. Selim.European journal of operational research. 2005, Vol 167, Num 3, pp 624-643, issn 0377-2217, 20 p.Article

A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraintsJOO, B.-J; KIM, Y.-D.The Journal of the Operational Research Society. 2009, Vol 60, Num 4, pp 572-582, issn 0160-5682, 11 p.Article

Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effectKUO, W.-H; YANG, D.-L.The Journal of the Operational Research Society. 2008, Vol 59, Num 3, pp 416-420, issn 0160-5682, 5 p.Article

Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planningLIN, Shih-Wei; YING, Kuo-Ching; HUANG, Chien-Yi et al.Computers & operations research. 2013, Vol 40, Num 5, pp 1186-1195, issn 0305-0548, 10 p.Article

Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problemsTRABELSI, Wajdi; SAUVEY, Christophe; SAUER, Nathalie et al.Computers & operations research. 2012, Vol 39, Num 11, pp 2520-2527, issn 0305-0548, 8 p.Article

Minimizing makespan in an ordered flow shop with machine-dependent processing timesCHOI, Byung-Cheon; LEUNG, Joseph Y-T; PINEDO, Michael L et al.Journal of combinatorial optimization. 2011, Vol 22, Num 4, pp 797-818, issn 1382-6905, 22 p.Article

An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespanMIN JI; CHENG, T. C. E.Information processing letters. 2008, Vol 108, Num 4, pp 171-174, issn 0020-0190, 4 p.Article

Heuristic algorithms for two machine re-entrant flow shopCAIXIA JING; GUOCHUN TANG; XINGSAN QIAN et al.Theoretical computer science. 2008, Vol 400, Num 1-3, pp 137-143, issn 0304-3975, 7 p.Article