Handbook of Combinatorial Optimization pp 1493-1641 | Cite as

# A Review of Machine Scheduling: Complexity, Algorithms and Approximability

## Abstract

The scheduling of computer and manufacturing systems has been the subject of extensive research for over forty years. In addition to computers and manufacturing, scheduling theory can be applied to many areas including agriculture, hospitals and transport. The main focus is on the efficient allocation of one or more resources to activities over time. Adopting manufacturing terminology, a *job* consists of one or more activities, and a *machine* is a resource that can perform at most one activity at a time. We concentrate on *deterministic machine scheduling* for which it is assumed that all data that define a problem instance are known with certainty.

## Keywords

Schedule Problem Competitive Ratio Flow Shop Precedence Constraint Open Shop## Preview

Unable to display preview. Download preview PDF.

## References

- [1]E.H.L. Aarts and J.K. Lenstra (eds.),
*Local Search in Combinatorial Optimization*, Wiley, Chichester, 1997.MATHGoogle Scholar - [2]E.H.L. Aarts, P.J.M. van Laarhoven, J.K. Lenstra and N.L.J. Ulder, A computational study of local search algorithms for job shop scheduling,
*ORSA Journal on Computing*6 (1994), 118–125.MATHGoogle Scholar - [3]T.S. Abdul-Razaq and C.N. Potts, Dynamic programming state-space relaxation for single-machine scheduling,
*Journal of the Operational Research Society*39 (1988), 141–152.MATHGoogle Scholar - [4]T.S. Abdul-Razaq, C.N. Potts and L.N. Van Wassenhove, A survey of algorithms for the single machine total weighted tardiness scheduling problem,
*Discrete Applied Mathematics*26 (1990), 235–253.MATHMathSciNetCrossRefGoogle Scholar - [5]J.O. Achugbue and F.Y. Chin, Bounds on schedules for independent tasks with similar execution times.
*Journal of the Association for Computing Machinery*28 (1981), 81–99.MATHMathSciNetCrossRefGoogle Scholar - [6]J.O. Achugbue and F.Y. Chin, Scheduling the open shop to minimize mean flow time,
*SIAM Journal on Computing*11 (1982), 709–720.MATHCrossRefGoogle Scholar - [7]J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job shop scheduling,
*Management Science*34 (1988), 391–401.MATHMathSciNetCrossRefGoogle Scholar - [8]B. Adenso-Dias, Restricted neighborhood in the tabu search for the flowshop problem,
*European Journal of Operational Research*62 (1992), 27–37.CrossRefGoogle Scholar - [9]I. Adiri and N. Aizikowitz, Open shop scheduling problems with dominated machines,
*Operations Research*,*Statistics and Economics Mimeograph Series**383*, Technion, Haifa, Israel, 1986.Google Scholar - [10]D. Adolphson and T.C. Hu, Optimal linear ordering,
*SIAM Journal on Applied Mathematics*25 (1973), 403–423.MATHMathSciNetCrossRefGoogle Scholar - [11]R.H. Ahmadi and U. Bagchi, Lower bounds for single-machine scheduling problems,
*Naval Research Logistics Quarterly*37 (1990), 967–979.MATHMathSciNetCrossRefGoogle Scholar - [12]R.H. Ahmadi and U. Bagchi, Improved lower bounds for minimizing the sum of completion times on n jobs over m machines in a flow shop,
*European Journal of Operational Research*44 (1990), 331–336.MATHMathSciNetCrossRefGoogle Scholar - [13]S.B. Akers, A graphical approach to production scheduling problems,
*Operations Research*4 (1956), 244–245.CrossRefGoogle Scholar - [14]S.B. Akers and J. Friedman, A non-numerical approach to production scheduling problems,
*Operations Research*3 (1955), 429–442.CrossRefGoogle Scholar - [15]V.A. Aksjonov, A polynomial-time algorithm for an approximate solution of a scheduling problem (in Russian),
*Upravlyaemye Sistemy*28 (1988), 8–11.Google Scholar - [16]S. Albers, Better bounds for online scheduling,
*Proceedings of the 29th Annual ACM Symposium on Theory of Computing*(1997), 130–139.Google Scholar - [17]H.H. Ali and H. El-Rewini, An optimal algorithm for scheduling interval ordered tasks with communication on N processors,
*Journal of Computing and System Sciences*51 (1995), 301–306.MATHMathSciNetCrossRefGoogle Scholar - [18]B. Alidaee and A. Ahmadian, Two parallel machine sequencing problems involving controllable job processing times,
*European Journal of Operational Research*70 (1993), 335–341.MATHCrossRefGoogle Scholar - [19]B. Alidaee and S. Gopalan, A note on the equivalence of two heuristics to minimize total tardiness,
*European Journal of Operational Research*96 (1997), 514–517.MATHCrossRefGoogle Scholar - [20]N. Alon, Y. Azar, G.J. Woeginger and T. Yadid, Approximation schemes for scheduling,
*Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms*(1997), 493–500.Google Scholar - [21]N. Alon, Y. Azar, G.J. Woeginger and T. Yadid, Approximation schemes for scheduling on parallel machines, Technical Report Woe-18, Department of Mathematics, TU Graz, Graz, Austria, 1997. To appear in
*Journal of Scheduling*Google Scholar - [22]A.K. Amoura, E. Bampis, C. Kenyon and Y. Manoussakis, Scheduling independent multiprocessor tasks,
*Proceedings of the 5th Annual European Symposium on Algorithms*(1997), 1–12.Google Scholar - [23]E.J. Anderson, C.A. Glass and C.N. Potts, Machine scheduling, in E.H.L. Aarts and J.K. Lenstra (eds.)
*Local Search in Combinatorial Optimization*, Wiley, Chichester, 1997, 361–414.Google Scholar - [24]D. Applegate and W. Cook, A computational study of the job-shop scheduling problem,
*ORSA Journal on Computing*3 (1991), 149–156.MATHGoogle Scholar - [25]J. Aspnes, Y. Azar, A. Fiat, S. Plotkin and O. Waarts, On-line load balancing with applications to machine scheduling and virtual circuit routing,
*Journal of the Association for Computing Machinery*44 (1997), 486–504.MATHMathSciNetCrossRefGoogle Scholar - [26]A. Avidor, Y. Azar and J. Sgall, Ancient and new algorithms for load balancing in the
*L**p*norm,*Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms*(1998), 426–435.Google Scholar - [27]B. Awerbuch, Y. Azar, E. Grove, M. Kao, P. Krishnan and J. Vitter, Load balancing in the
*L**p*norm,*Proceedings of the 36th IEEE Symposium on Foundations of Computer Science*(1995), 383–391.Google Scholar - [28]Y. Azar, J. Naor and R. Rom, The competitiveness of on-line assignments,
*Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms*(1992), 203–210.Google Scholar - [29]U. Bagchi, R.S. Sullivan and Y.-L. Chang, Minimizing mean squared deviations of completion times about a common due date,
*Management Science*33 (1987), 894–906.MATHMathSciNetCrossRefGoogle Scholar - [30]K.R. Baker,
*Introduction to Sequencing and Scheduling*, Wiley, New York, 1974.Google Scholar - [31]K.R. Baker and J.W. Bertrand, A dynamic priority rule for scheduling against due dates,
*Journal of Operations Management*3 (1982), 37–42.CrossRefGoogle Scholar - [32]K.R. Baker, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints,
*Operations Research*31 (1983), 381–386.CrossRefGoogle Scholar - [33]K.R. Baker and G.D. Scudder, Sequencing with earliness and tardiness penalties: a review,
*Operations Research*38 (1990), 22–36.MATHMathSciNetCrossRefGoogle Scholar - [34]K.R. Baker and Z.-S. Su, Sequencing with due-dates and early start times to minimize maximum tardiness,
*Naval Research Logistics Quarterly*21 (1974), 171–176.MATHMathSciNetCrossRefGoogle Scholar - [35]E. Balas, Project scheduling with resource constraints, in E.M.L. Beale (ed.)
*Applications of Mathematical Programming Techniques*, English University Press, London, 1970, 187–200.Google Scholar - [36]E. Balas, On the facial structure of scheduling polyhedra,
*Mathematical Programming Study*24 (1985), 179–218.MATHMathSciNetGoogle Scholar - [37]E. Balas, J.K. Lenstra and A. Vazacopoulos, The one-machine problem with delayed precedence constraints and its use on job shop scheduling,
*Management Science*41 (1995), 94–109.MATHCrossRefGoogle Scholar - [38]E. Balas and A. Vazacopoulos, Guided local search with shifting bottleneck for job shop scheduling, Management Science Research Report MSSR-609, Carnegie Mellon University, Pittsburgh, USA, 1994.Google Scholar
- [39]I. Bazany, A vector-sum theorem and its application to improving flow shop guarantees,
*Mathematics of Operations Research*6 (1981), 445–452.MathSciNetCrossRefGoogle Scholar - [40]I. Bârdny and T. Fiala, Nearly optimum solution of multimachine scheduling problems (in Hungarian),
*Szigma Mathematika Közgazdasdgi FolyGirat*15 (1982), 177–191.Google Scholar - [41]J.R. Barker and G.B. McMahon, Scheduling the general job-shop,
*Management Science*31 (1985), 594–598.MATHCrossRefGoogle Scholar - [42]J.W. Barnes and J.J. Brennan, An improved algorithm for scheduling jobs on identical machines,
*AIIE Transactions*9 (1977), 25–31.Google Scholar - [43]J.W. Barnes and J.B. Chambers, Solving the job shop scheduling problem using tabu search,
*HE Transactions*27 (1995), 257–263.Google Scholar - [44]Y. Bartal, A. Fiat, H. Karloff and R. Vohra, New algorithms for an ancient scheduling problem,
*Journal of Computing and System Sciences*51 (1995), 359–366.MathSciNetCrossRefGoogle Scholar - [45]Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall and L. Stougie, Multiprocessor scheduling with rejection,
*Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms*(1996), 95–103. To appear in*SIAM Journal on Discrete Mathematics*Google Scholar - [46]M. Bartusch, R.H. Möhring and F.J. Radermacher, Scheduling project networks with resource constraints and time windows,
*Annals of Operations Research*16 (1988), 201–240.MathSciNetCrossRefGoogle Scholar - [47]H. Belouadah, M.E. Posner and C.N. Potts, Scheduling with release dates on a single machine to minimize total weighted completion time,
*Discrete Applied Mathematics*36 (1992), 213–231.MATHMathSciNetCrossRefGoogle Scholar - [48]H. Belouadah and C.N. Potts, Scheduling identical parallel machines to minimize total weighted completion time,
*Discrete Applied Mathematics*48 (1994), 201–218.MATHMathSciNetCrossRefGoogle Scholar - [49]I.S. Belov and J.I. Stolin, An algorithm for the flow shop problem (in Russian), in
*Mathematical Economics and Functional Analysis*, Nauka, Moscow, 1974, 248–257.Google Scholar - [50]P. Berman, M. Charikar and M. Karpinski, On-line load balancing for related machines,
*Proceedings of the 5th Workshop on Algorithms and Data Structures*(1997), 116–125.Google Scholar - [51]L. Bianco and S. Ricciardelli, Scheduling a single machine to minimize total weighted completion time subject to release dates,
*Naval Research Logistics Quarterly*29 (1982), 151–167.MATHCrossRefGoogle Scholar - [52]J. Blaiewicz, W. Cellary, R. Slowinski and J. Wçglarz,
*Scheduling under Resource Constraints—Deterministic Models*, (Annals of Operations Research, Volume 7 ), J.C. Baltzer AG, Basel, Switzerland, 1986.Google Scholar - [53]J. Blaiewicz, M. Drabowski and J. Wgglarz, Scheduling multiprocessor tasks to minimize schedule length,
*IEEE Transactions on Computing*35 (1986), 389–393.CrossRefGoogle Scholar - [54]J. Blaiewicz, M. Drozdowski, G. Schmidt and D. de Werra, Scheduling independent two processor tasks on a uniform k-processor system,
*Discrete Applied Mathematics*28 (1990), 11–20.CrossRefGoogle Scholar - [55]J. Blaiewicz, K.H. Ecker, G. Schmidt and J. Wgglarz,
*Scheduling in Computer and Manufacturing System*, Springer-Verlag, Berlin, 1994.CrossRefGoogle Scholar - [56]J. Blaiewicz, J.K. Lenstra and A.H.G. Rinnooy Kan, Scheduling subject to resource constraints: Classification and complexity,
*Discrete Applied Mathematics*5 (1983), 11–24.MathSciNetCrossRefGoogle Scholar - [57]H. Bräsel, T. Tautenhahn and F. Werner, Constructive heuristic algorithms for the open shop problem,
*Computing*51 (1993), 95–110.MATHCrossRefGoogle Scholar - [58]P. Bratley, M. Florian and P. Robillard, On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem,
*Naval Research Logistics Quarterly*20 (1973), 57–67.MATHMathSciNetCrossRefGoogle Scholar - [59]P. Bratley, M. Florian and P. Robillard, Scheduling with earliest start and due date constraints on multiple machines,
*Naval Research Logistics*Quarterly 22 (1975), 165–173.MATHCrossRefGoogle Scholar - [60]P. Brucker, Minimizing maximum lateness in a two-machine unit-time job shop,
*Computing*27 (1981), 367–370.MATHCrossRefGoogle Scholar - [61]P. Brucker, A polynomial time algorithm for the two machine job-shop scheduling problem with a fixed number of jobs,
*OR Spektrum*16 (1994), 5–7.MATHMathSciNetCrossRefGoogle Scholar - [62]P. Brucker, J. Hurink, B. Jurisch and B. Wöstmann, A branch & bound algorithm for the open-shop problem,
*Discrete Applied Mathematics*76 (1997), 43–59.MATHMathSciNetCrossRefGoogle Scholar - [63]P. Brucker, J. Hurink and F. Werner, Improved local search heuristics for some scheduling problems. Part I,
*Discrete Applied Mathematics*65 (1996), 97–122.MATHMathSciNetCrossRefGoogle Scholar - [64]P. Brucker, J. Hurink and F. Werner, Improved local search heuristics for some scheduling problems. Part II,
*Discrete Applied Mathematics*72 (1997), 47–69.MATHMathSciNetCrossRefGoogle Scholar - [65]P. Brucker and B. Jurisch, A new lower bound for the job-shop scheduling problem,
*European Journal of Operational Research*64 (1993), 156–167.MATHCrossRefGoogle Scholar - [66]P. Brucker, B. Jurisch and M. Jurisch, Open shop problems with unit time operations,
*ZOR-Mathematical Methods of Operations Research*37 (1993), 59–73.MATHMathSciNetCrossRefGoogle Scholar - [67]P. Brucker, B. Jurisch and A. Krämer, The job-shop problem and immediate selection,
*Annals of Operations Research*50 (1994), 73–114.MATHMathSciNetCrossRefGoogle Scholar - [68]P. Brucker, B. Jurisch and B. Sievers, A branch & bound algorithm for the job-shop scheduling problem,
*Discrete Applied Mathematics*49 (1994), 107–127.MATHMathSciNetCrossRefGoogle Scholar - [69]P. Brucker, S.A. Kravchenko and Y.N. Sotskov, On the complexity of two machine job-shop scheduling with regular objective functions,
*OR Spektrum*19 (1997), 5–10.MATHMathSciNetCrossRefGoogle Scholar - [70]P. Brucker, S.A. Kravchenko and Y.N. Sotskov, Preemptive job-shop scheduling problems with a fixed number of jobs, Osnabrücker Schriften zur Mathematik, Heft 184, Universität Osnabrück, Germany, 1997.Google Scholar
- [71]J.L. Bruno, E.G. Coffman, Jr., and R. Sethi, Scheduling independent tasks to reduce mean finishing time,
*Communications of the ACM**17*(1974), 382–387.MATHMathSciNetCrossRefGoogle Scholar - [72]J.L. Bruno, E.G. Coffman, Jr., and R. Sethi, Algorithms for minimizing mean flow time,
*Proceedings of the IFIP Congress*, North-Holland, Amsterdam, 1974, 504–510.Google Scholar - [73]J.L. Bruno and P.J. Downey, Complexity of task sequencing with deadlines, set-up times and changeover costs,
*SIAM Journal on Computing*7 (1978), 393–404.MATHMathSciNetCrossRefGoogle Scholar - [74]J.L. Bruno and T. Gonzalez, Scheduling independent tasks with release dates and due dates on parallel machines, Technical Report 213, Computer Science Department, Pennsylvania State University, USA, 1976.Google Scholar
- [75]H. Buer & R.H. Möhring, A fast algorithm for the decomposition of graphs and posets,
*Mathematics of Operations Research*8 (1983), 170–184.MATHMathSciNetCrossRefGoogle Scholar - [76]X. Cai, Minimization of agreeably weighted variance in single-machine systems,
*European Journal of Operational Research*85 (1995), 576–592.MATHCrossRefGoogle Scholar - [77]X. Cai, C.-Y. Lee and C.-L. Li, Minimizing total completion time in two-processor task systems with prespecified processor allocations,
*Naval Research Logistics*45 (1998), 231–242.MATHMathSciNetCrossRefGoogle Scholar - [78]H.G. Campbell, R.A. Dudek and M.L. Smith A heuristic algorithm for the n job, m machine sequencing problem,
*Management Science*16B (1970), 630–637.Google Scholar - [79]J. Carlier, The one-machine sequencing problem,
*European Journal of Operational Research*11 (1982), 42–47.MATHMathSciNetCrossRefGoogle Scholar - [80]J. Carlier, Scheduling jobs with release dates and tails on identical machines to minimize the makespan, European
*Journal of Operational Research*29 (1987), 298–306.MATHMathSciNetCrossRefGoogle Scholar - [81]J. Carlier and E. Pinson, An algorithm for solving the job-shop problem,
*Management Science*35 (1989), 164–176.MATHMathSciNetCrossRefGoogle Scholar - [82]J. Carlier and E. Pinson, A practical use of Jackson’s preemptive schedule for solving the job shop problem,
*Annals of Operations Research*26 (1990), 269–287.MATHMathSciNetGoogle Scholar - [83]J. Carlier and E. Pinson, Adjustment of heads and tails for the job-shop problem,
*European Journal of Operational Research*78 (1994), 146–161.MATHCrossRefGoogle Scholar - [84]S. Chakrabarti, C.A. Phillips, A.S. Schulz, D.B. Shmoys, C. Stein, and J. Wein, Improved scheduling algorithms for minsum criteria,
*Proceedings of the 23rd International Colloquium on Automata*,*Languages and Programming*(1996), 646–657.Google Scholar - [85]L.M.A. Chan, P. Kaminsky, A. Muriel and D. Simchi-Levi, Machine scheduling, linear programming and list scheduling heuristics, Manuscript, Department of Industrial Engineering, Northwestern University, Evanston, USA, 1995.Google Scholar
- [86]S. Chang, Q. Lu, G. Tang and W. Yu, On decomposition of the total tardiness problem,
*Operations Research Letters*17 (1995), 221–229.MATHMathSciNetCrossRefGoogle Scholar - [87]S. Chang, H. Matsuo and G. Tang, Worst-case analysis of local search heuristics for the one-machine total tardiness problem,
*Naval Research Logistics Quarterly*37 (1990), 111–121.MATHMathSciNetCrossRefGoogle Scholar - [88]J.M. Charlton and C.C. Death A generalized machine scheduling algorithm,
*Operational Research Quarterly*21 (1970), 127–134.MATHCrossRefGoogle Scholar - [89]C. Chekuri, R. Motwani, B. Natarajan and C. Stein, Approximation techniques for average completion time scheduling,
*Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms*(1997), 609–618.Google Scholar - [90]B. Chen, Tighter bounds for MULTIFIT scheduling on uniform processors,
*Discrete Applied Mathematics*31 (1991), 227–260.MATHMathSciNetCrossRefGoogle Scholar - [91]B. Chen, A better heuristic for preemptive parallel machine scheduling with batch setup times,
*SIAM Journal on Computing*22 (1993), 1303–1318.MATHMathSciNetCrossRefGoogle Scholar - [92]B. Chen, C.N. Potts and V.A. Strusevich, Approximation algorithms for two-machine flow shop scheduling with batch setup times,
*Mathematical Programming*(1998), to appear.Google Scholar - [93]B. Chen and V.A. Strusevich, Approximation algorithms for three-machine open shop scheduling,
*ORSA Journal on Computing*5 (1993), 321–326.MATHGoogle Scholar - [94]B. Chen, A. van Vliet and G.J. Woeginger, New lower and upper bounds for on-line scheduling,
*Operations Research Letters*16 (1994), 221–230.MATHMathSciNetCrossRefGoogle Scholar - [95]B. Chen, A. van Vliet and G.J. Woeginger, An optimal algorithm for preemptive on-line scheduling,
*Operations Research Letters*18 (1995), 127–131.MATHMathSciNetCrossRefGoogle Scholar - [96]B. Chen and A. Vestjens, Scheduling on identical machines: How good is LPT in an on-line setting?
*Operations Research Letters*21 (1998), 165–169.MathSciNetCrossRefGoogle Scholar - [97]B. Chen, A.P.A. Vestjens and G.J. Woeginger, On-line scheduling of two-machine open shops where jobs arrive over time,
*Journal of Combinatorial Optimization*1 (1997), 355–365.MATHMathSciNetCrossRefGoogle Scholar - [98]B. Chen and G.J. Woeginger, A study of on-line scheduling two-stage shops, in D.-Z. Du and P.M. Pardalos (eds.)
*Minimax and Applications*, Kluwer Academic Publishers, 1995, 97–107.Google Scholar - [99]C.-L. Chen and R.L. Bulfin, Complexity of single machine, multi-criteria scheduling problems,
*European Journal of Operational Research*70 (1993), 115–125.MATHCrossRefGoogle Scholar - [100]Z.L. Chen, Q. Lu and G. Tang, Single machine scheduling with discretely controllable processing times,
*Operations Research Letters*21 (1997), 69–76.MATHMathSciNetCrossRefGoogle Scholar - [101]Z.L. Chen and W.B. Powell, Solving parallel machine total weighted completion time problems by column generation, Manuscript, Department of Civil Engineering and Operations Research, Princeton University, Princeton, USA, 1995.Google Scholar
- [102]T.C.E. Cheng, Optimal common due date with limited completion time deviation,
*Computers and Operations Research*15 (1988), 91–96.MATHCrossRefGoogle Scholar - [103]T.C.E. Cheng, A note on the equivalence of the Wilkerson-Irwin and Modified Due-Date rules for the mean tardiness sequencing problem,
*Computers and Industrial Engineering*22 (1992), 63–66.CrossRefGoogle Scholar - [104]T.C.E. Cheng and C.C.S. Sin, A state-of-the-art review of parallel-machine scheduling research,
*European Journal of Operational Research*47 (1990), 271–292.MATHCrossRefGoogle Scholar - [105]Y. Cho and S. Sahni, Bounds for list schedules on uniform processors,
*SIAM Journal on Computing*9 (1980), 91–103.MATHMathSciNetCrossRefGoogle Scholar - [106]Y. Cho and S. Sahni, Preemptive scheduling of independent jobs with release and due times on open, flow and job shops,
*Operations Research*29 (1981), 511–522.MATHMathSciNetCrossRefGoogle Scholar - [107]P. Chrétienne and C. Picouleau, Scheduling with communication delays: a survey, in P. Chrétienne, E.G. Coffman, J.K. Lenstra and Z.Liu (eds.)
*Scheduling theory and its applications*, Chichester, John Wiley & Sons, 1995, 65–90.Google Scholar - [108]C. Chu, A branch-and-bound algorithm to minimize total tardiness with different release dates,
*Naval Research Logistics*39 (1992), 265–283.MATHCrossRefGoogle Scholar - [109]C. Chu, A branch-and-bound algorithm to minimize total flow time with unequal release dates,
*Naval Research Logistics*39 (1992), 859–875.MATHMathSciNetCrossRefGoogle Scholar - [110]F. Chudak and D.B. Shmoys, Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds,
*Proceedings of the 8th*Annual*ACM-SIAM Symposium on Discrete Algorithms*(1997), 581–590.Google Scholar - [111]E.G. Coffman, Jr., M.R. Garey and D.S. Johnson, An application of bin-packing to multiprocessor scheduling,
*SIAM Journal on Computing*7 (1978), 1–17.MATHMathSciNetCrossRefGoogle Scholar - [112]J.-Y. Colin and P. Chrétienne, CPM scheduling with small communication delays.
*Operations Research*39 (1991), 680–684.MATHCrossRefGoogle Scholar - [113]R.K. Congram, C.N. Potts and S.L. van de Velde, Dynasearch—iterative local improvement by dynamic programming: The total weighted tardiness problem, Preprint, Faculty of Mathematical Studies, University of Southampton, Southampton, UK, 1998.Google Scholar
- [114]R.W. Conway, W.L. Maxwell and L.W. Miller,
*Theory of Scheduling*, Addison-Wesley, Reading, 1967.MATHGoogle Scholar - [115]H.A.J. Crauwels, A.MA. Hariri, C.N. Potts and L.N. Van Wassenhove, Branch and bound algorithms for single machine scheduling with batch setup times to minimize total weighted completion time,
*Annals of Operations Research*, to appear.Google Scholar - [116]H.A.J. Crauwels, C.N. Potts and L.N. Van Wassenhove, Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs,
*European Journal of Operational Research*90 (1996), 200–213.MATHCrossRefGoogle Scholar - [117]H.A.J. Crauwels, C.N. Potts and L.N. Van Wassenhove, Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time,
*Annals of Operations Research*70 (1997), 261–279MATHMathSciNetCrossRefGoogle Scholar - [118]H.A.J. Crauwels, C.N. Potts and L.N. Van Wassenhove, Local search heuristics for the single machine total weighted tardiness scheduling problem,
*INFORMS Journal on Computing*, to appear.Google Scholar - [119]H.A.J. Crauwels, C.N. Potts and L.N. Van Wassenhove, Local search heuristics for single machine scheduling with batching to minimize total weighted completion time, Unpublished manuscript, 1995.Google Scholar
- [120]D.G. Dannenbring, An evaluation of flow-shop sequencing heuristics,
*Management Science*23 (1977), 1174–1182.MATHCrossRefGoogle Scholar - [121]S. Dauzère-Pérès and J.-B. Lasserre, A modified shifting bottleneck procedure for job-shop scheduling,
*International Journal of Production Research*31 (1993), 923–932.MATHCrossRefGoogle Scholar - [122]S. Dauzère-Pérès, Minimizing late jobs in the general one machine scheduling problem,
*European Journal of Operational Research*81 (1995), 134–142.MATHCrossRefGoogle Scholar - [123]E.W. Davis, Resource allocation in project network models—A survey,
*Journal of Industrial Engineering**17*(1966), 177–188.Google Scholar - [124]E.W. Davis, Project scheduling under resource constraints—Historical review and categorization of procedures,
*AIIE Transactions*5 (1973), 297–313.Google Scholar - [125]E.W. Davis and G.E. Heidorn, An algorithm for optimal project scheduling under multiple resource constraints.
*Management Science**17*(1971), 803–816.CrossRefGoogle Scholar - [126]E. Davis and J.M. Jaffe, Algorithms for scheduling tasks on unrelated processors,
*Journal of the Association for Computing Machinery*28 (1981), 721–736.MATHMathSciNetCrossRefGoogle Scholar - [127]J.S. Davis and J.J. Kanet, Single-machine scheduling with early and tardy completion costs,
*Naval Research Logistics*40 (1993), 85–101.MATHCrossRefGoogle Scholar - [128]P. De, J.B. Ghosh and C.E. Wells, On the minimization of completion time variance with a bicriteria extension,
*Operations Research*40 (1992), 1148–1155.MATHCrossRefGoogle Scholar - [129]F. Della Croce, V. Narayan and R. Tadei, The two-machine total completion time flow shop problem,
*European Journal of Operational Research*, to appear.Google Scholar - [130]F. Della Croce, R. Tadei and G. Volta, A genetic algorithm for the job shop problem,
*Computers and Operations Research*22 (1995), 15–24.MATHCrossRefGoogle Scholar - [131]F. Della Croce, W. Szwarc, R. Tadei, P. Baracco and R. Di Tullio, Minimizing the weighted sum of quadratic completion times on a single machine,
*Naval Research Logistics*42 (1995), 1263–1270.MATHCrossRefGoogle Scholar - [132]F. Della Croce, R. Tadei, P. Baracco and A. Grosso, A new decomposition approach for the single machine total tardiness problem,
*Journal of the Operational Research Society*, to appear.Google Scholar - [133]M. Dell’Amico and S. Martello, Optimal scheduling of tasks on identical parallel processors,
*ORSA Journal on Computing**7*(1995), 191–200MATHGoogle Scholar - [134]M. Dell’Amico and M. Trubian, Applying tabu-search to the job-shop scheduling problem,
*Annals of Operations Research*41 (1993), 231–252.MATHCrossRefGoogle Scholar - [135]E. Demeulemeester and W. Herroelen, A branch-and-bound procedure for the multiple resource-constrained project scheduling problem,
*Management Science*38 (1992), 1803–1818.MATHCrossRefGoogle Scholar - [136]E. Demeulemeester and W. Herroelen, A branch-and-bound procedure for the generalized resource-constrained project scheduling problem,
*Operations Research*45 (1997), 201–212.MATHCrossRefGoogle Scholar - [137]J.S. Deogun, On scheduling with ready times to minimize mean flow time,
*The Computer Journal*26 (1983), 320–328.MATHMathSciNetGoogle Scholar - [138]M.I. Dessouky and J.S. Deogun, Sequencing jobs with unequal ready times to minimize mean flow time,
*SIAM Journal on Computing*10 (1981), 192–202.MATHMathSciNetCrossRefGoogle Scholar - [139]M.I. Dessouky, B.J. Lageweg, J.K. Lenstra and S.L. van de Velde, Scheduling identical jobs on uniform parallel machines,
*Statistica Neerlandica*44 (1990), 115–123.MATHMathSciNetCrossRefGoogle Scholar - [140]P. Dileepan and T. Sen, Bicriterion static scheduling research for a single machine,
*OMEGA*16 (1988), 53–59.CrossRefGoogle Scholar - [141]G. Dobson, Scheduling independent tasks on uniform processors.
*SIAM Journal on Computing*13 (1984), 705–716.MATHMathSciNetCrossRefGoogle Scholar - [142]U. Dorndorf and E. Pesch, Evolution based learning in a job shop scheduling environment,
*Computers and Operations Research*22 (1993), 25–40.CrossRefGoogle Scholar - [143]I.G. Drobouchevitch and V.A. Strusevich, Heuristics for the two-stage job shop scheduling problem with a bottleneck machine, CASSM R&D Paper 11, Centre for Applied Statistics and Systems Modelling, University of Greenwich, London, UK, 1997.Google Scholar
- [144]I.G. Drobouchevitch and V.A. Strusevich, A polynomial algorithm for the three machine open shop with a bottleneck machine, CASSM R&D Paper 13, Centre for Applied Statistics and Systems Modelling, University of Greenwich, London, UK, 1997.Google Scholar
- [145]M. Drozdowski, On the complexity of multiprocessor task scheduling,
*Bulletin of the Polish Academy of Sciences. Technical Sciences*43 (1995), 381–392.MATHGoogle Scholar - [146]M. Drozdowski, Scheduling multiprocessor tasks-An overview, European Journal of Operational Research 94 (1996), 215–230.MATHCrossRefGoogle Scholar
- [147]J. Du and J.Y.-T. Leung, Complexity of scheduling parallel task systems,
*SIAM Journal on Discrete Mathematics*2 (1989), 473–487.MATHMathSciNetCrossRefGoogle Scholar - [148]J. Du and J.Y.-T. Leung, Minimizing total tardiness on one processor is NP-hard,
*Mathematics of Operations Research*15 (1990), 483–495.MATHMathSciNetCrossRefGoogle Scholar - [149]J. Du and J.Y.-T. Leung, Minimizing mean flow time with release time and deadline constraints,
*Journal of Algorithms*14 (1993), 45–68.MATHMathSciNetCrossRefGoogle Scholar - [150]J. Du and J.Y.-T. Leung, Minimizing mean flow time in two-machine open shops and flow shops,
*Journal of Algorithms*14 (1993), 341–364.Google Scholar - [151]J. Du, J.Y.-T. Leung and C.S. Wong, Minimizing the number of late jobs with release time constraints, Technical Report, Computer Science Program, University of Texas, Dallas, USA, 1989.Google Scholar
- [152]J. Du, J.Y.-T. Leung and G.H. Young, Minimizing mean flow time with release time constraints, Technical Report, Computer Science Program, University of Texas, Dallas, USA, 1988.Google Scholar
- [153]J. Du, J.Y.-T. Leung and G.H. Young, Scheduling chain-structured tasks to minimize makespan and mean flow
*time*,*Information and Computation*92 (1991), 219–236.MATHMathSciNetCrossRefGoogle Scholar - [154]M.E. Dyer and L.A. Wolsey, Formulating the single machine sequencing problem with release dates as a mixed integer program,
*Discrete Applied Mathematics*26 (1990), 255–270.MATHMathSciNetCrossRefGoogle Scholar - [155]W.L. Eastman, S. Even and I.M. Isaacs, Bounds for the optimal scheduling of n jobs on m processors,
*Management Science*11 (1964), 268–279.MathSciNetCrossRefGoogle Scholar - [156]J. Edmonds, D.D. Chinn, T. Brecht and X. Deng, Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics,
*Proceedings of the 29th Annual ACM Symposium on Theory of Computing*(1997), 120–129.Google Scholar - [157]S. Eilon and I.G. Chowdhury, Minimizing waiting time variance in the single machine problem,
*Management Science*23 (1977), 567–575.MATHMathSciNetCrossRefGoogle Scholar - [158]S.E. Elmaghraby, The one-machine sequencing problem with delay costs,
*Journal of Industrial Engineering*19 (1968), 105–108.Google Scholar - [159]S.E. Elmaghraby and S.H. Park, Scheduling jobs on a number of identical machines,
*AILE Transactions*6 (1974), 1–12.MathSciNetGoogle Scholar - [160]H. Emmons, One-machine sequencing to minimize certain functions of job tardiness,
*Operations Research*17 (1969), 701–715.MATHMathSciNetCrossRefGoogle Scholar - [161]L. Epstein, J. Noga, S.S. Seiden, J. Sgall and G.J. Woeginger, On-line scheduling for two related machines, unpublished manuscript, 1997.Google Scholar
- [162]P. Erdlis and L. Lovâsz, Problems and results on 3-chromatic hypergraphs and some related questions, In:
*Infinite and Finite Sets*(A. Hajnal, R. Rado and V.T. Sôs, eds.), North-Hollnd, Amsterdam, 1975. 609–628.Google Scholar - [163]U. Faigle, W. Kern and G. Turan, On the performance of on-line algorithms for partition problems,
*Acta Cybernetica*9 (1989), 107–119.MATHMathSciNetGoogle Scholar - [164]A. Federgruen and H. Groenevelt, Preemptive scheduling of uniform machines by ordinary network flow techniques,
*Management Science*32 (1986), 341–349.MATHMathSciNetCrossRefGoogle Scholar - [165]U. Feige and C. Scheideler, Improved bounds for acyclic job shop scheduling, manuscript, Weizmann Institute, Rehovot, Israel, 1997.Google Scholar
- [166]A. Feldmann, M.-Y. Kao, J. Sgall and S.-H. Teng, Optimal online scheduling of parallel jobs with dependencies,
*Proceedings of the 25th Annual ACM Symposium on Theory of Computing*(1993), 642–651.Google Scholar - [167]A. Feldmann, J. Sgall and S.-H. Teng, Dynamic scheduling on parallel machines,
*Theoretical Computer Science*130 (1994), 49–72.MATHMathSciNetCrossRefGoogle Scholar - [168]T. Fiala, An algorithm for the open-shop problem,
*Mathematics of Operations Research*8 (1983), 100–109.MATHMathSciNetCrossRefGoogle Scholar - [169]A. Fiat and G.J. Woeginger, On-line scheduling on a single machine: Minimizing the total completion time, Technical Report Woe-04, Department of Mathematics, TU Graz, Graz, Austria, 1997.Google Scholar
- [170]G. Finn and E. Horowitz, A linear time approximation algorithm for multiprocessor scheduling,
*BIT*19 (1979), 312–320.MATHMathSciNetCrossRefGoogle Scholar - [171]H. Fisher and G.L. Thompson, Probabilistic learning combinations of local job-shop scheduling rules, in J.F. Muth and G.L. Thompson (eds.)
*Industrial Scheduling*, Prentice Hall, Englewood Cliffs, 1963, 225–251.Google Scholar - [172]M.L. Fisher, A dual algorithm for the one-machine scheduling problem,
*Mathematical Programming*11 (1976), 229–251.MathSciNetCrossRefGoogle Scholar - [173]M.L. Fisher, B.J. Lageweg, J.K. Lenstra and A.H.G. Rinnooy Kan, Surrogate duality relaxation for job shop scheduling,
*Discrete Applied Mathematics*5 (1983), 65–75.MATHCrossRefGoogle Scholar - [174]P.M. França, M: Gendreau, G. Laporte and F.M. Müller, A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective,
*Computers and Operations Research*21 (1994), 205–210.MATHCrossRefGoogle Scholar - [175]G.M. Frederickson, Scheduling unit-time tasks with integer release times and deadlines,
*Information Processing Letters*16 (1983), 171–173.MATHMathSciNetCrossRefGoogle Scholar - [176]S. French,
*Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop*, Horwood, Chichester, 1982.MATHGoogle Scholar - [177]D.K. Friesen, Tighter bounds for the multifit processor scheduling algorithm,
*SIAM Journal on Computing*13 (1984), 170–181.MATHMathSciNetCrossRefGoogle Scholar - [178]D.K. Friesen, Tighter bounds for LPT scheduling on uniform processors,
*SIAM Journal on Computing*16 (1987), 554–660.MATHMathSciNetCrossRefGoogle Scholar - [179]D.K. Friesen and M.A. Langston, Bounds for multifit scheduling on uniform processors,
*SIAM Journal on Computing*12 (1983), 60–70.MATHMathSciNetCrossRefGoogle Scholar - [180]D.K. Friesen and M.A. Langston, Evaluation of a MULTIFIT-based scheduling algorithm,
*Journal of Algorithms*7 (1986), 35–59.MATHMathSciNetCrossRefGoogle Scholar - [181]T.D. Fry, R.D. Armstrong and H. Lewis, A framework for single machine multiple objective sequencing research,
*OMEGA*17 (1989), 595–607.CrossRefGoogle Scholar - [182]T.D. Fry, L. Vicens, K. MacLeod and S. Fernandez, A heuristic solution procedure to minimize
*T*on a single-machine,*Journal of the Operational Research Society*40 (1989), 293–297.MATHGoogle Scholar - [183]M. Fujii, T. Kasami and K. Ninomiya, Optimal sequencing of two equivalent processors,
*SIAM Journal on Applied Mathematics**17*(1969), 784–789. Erratum:*SIAM Journal on Applied Mathematics*20 (1971), 141.MathSciNetCrossRefGoogle Scholar - [184]G. Galambos and G.J. Woeginger, An on-line scheduling heuristic with better worst case ratio than Graham’s List Scheduling,
*SIAM Journal on Computing*22 (1993), 349–355. Erratum: R. Chandrasekaran, B. Chen, G. Galambos, P.R. Narayanan, A. van Vliet and G.J. Woeginger, A note on “An on-line scheduling heuristic with better worst case ratio than Graham’s List Scheduling”,*SIAM Journal on Computing*26 (1997), 870–872.MATHMathSciNetCrossRefGoogle Scholar - [185]M.R. Garey and D.S. Johnson, Complexity results for multiprocessor scheduling under resource constraints,
*SIAM Journal on Computing*4 (1975), 397–411.MATHMathSciNetCrossRefGoogle Scholar - [186]M.R. Garey and D.S. Johnson, Scheduling tasks with nonuniform deadlines on two processors,
*Journal of the Association for Computing Machinery*23 (1976), 461–467.MATHMathSciNetCrossRefGoogle Scholar - [187]M.R. Garey and D.S. Johnson, Two-processor scheduling with start-times and deadlines,
*SIAM Journal on Computing*6 (1977), 416–426.MATHMathSciNetCrossRefGoogle Scholar - [188]M.R. Garey and D.S. Johnson, Strong NP-completeness results: motivation, examples and implications,
*Journal of the Association for Computing Machinery*25 (1978), 499–508.MATHMathSciNetCrossRefGoogle Scholar - [189]M.R. Garey and D.S. Johnson,
*Computers and Intractability: A Guide to the Theory of NP-Completeness*, Freeman, San Francisco, 1979.MATHGoogle Scholar - [190]M.R. Garey, D.S. Johnson and R. Sethi, The complexity of flowshop and jobshop scheduling,
*Mathematics of Operations Research**1*(1976), 117–129.MATHMathSciNetCrossRefGoogle Scholar - [191]M.R. Garey, D.S. Johnson, B.B. Simons and R.E. Tarjan, Scheduling unit-time tasks with arbitrary release dates and deadlines,
*SIAM Journal on Computing*10 (1981), 256–269.MATHMathSciNetCrossRefGoogle Scholar - [192]M.R. Garey, D.S. Johnson, R.E. Tarjan and M. Yannakakis, Scheduling opposing forests,
*SIAM Journal on Algebraic Discrete Mathematics*4 (1983), 72–93.MATHMathSciNetCrossRefGoogle Scholar - [193]M.R. Garey, R.E. Tarjan and G.T. Wilfong, One-processor scheduling with symmetric earliness and tardiness penalties,
*Mathematics of Operations Research*13 (1988), 330–348.MATHMathSciNetCrossRefGoogle Scholar - [194]L. Gelders and P.R. Kleindorfer, Coordinating aggregate and detailed scheduling decisions in the one-machine job shop: Part I. Theory,
*Operations Research*22 (1974), 46–60.MATHMathSciNetCrossRefGoogle Scholar - [195]L. Gelders and P.R. Kleindorfer, Coordinating aggregate and detailed scheduling decisions in the one-machine job shop: II—Computation and structure,
*Operations Research*23 (1975), 312–324.MATHMathSciNetCrossRefGoogle Scholar - [196]G.V. Gens and E.V. Levner, Approximation algorithms for certain universal problems in scheduling theory,
*Engineering Cybernetics*16 (1978), 31–36.MATHGoogle Scholar - [197]G.V. Gens and E.V. Levner, Fast approximation algorithm for job sequencing with deadlines.
*Discrete Applied Mathematics*3 (1981), 313–318.MATHCrossRefGoogle Scholar - [198]J.B. Ghosh, Batch scheduling to minimize total completion
*time*,*Operations Research Letters*16 (1994), 271–275.MATHCrossRefGoogle Scholar - [199]J.B. Ghosh and J.N.D. Gupta, Batch scheduling to minimize maximum lateness,
*Operations Research Letters*21 (1997) 77–80.MathSciNetCrossRefGoogle Scholar - [200]B. Giffler and G.L. Thompson, Algorithms for solving production-scheduling problems,
*Operations Research*8 (1960), 487–503.MATHMathSciNetCrossRefGoogle Scholar - [201]P.C. Gilmore and R.E. Gomory, Sequencing a one state-variable machine: a solvable case of the traveling salesman problem,
*Operations Research*12 (1964), 655–679.MATHMathSciNetCrossRefGoogle Scholar - [202]C.A. Glass, J.N.D. Gupta and C.N. Potts, Two-machine no-wait flow shop scheduling with missing operations, Preprint OR75, Faculty of Mathematical Studies, University of Southampton, Southampton, UK, 1995.Google Scholar
- [203]C.A. Glass and C.N. Potts, A comparison of local search methods for permutation flow shop scheduling,
*Annals of Operations Research*63 (1996), 489–509.MATHCrossRefGoogle Scholar - [204]C.A. Glass, C.N. Potts and P. Shade, Unrelated parallel machine scheduling using local search,
*Mathematical and Computer Modelling*20 (1994), 41–52.MATHMathSciNetCrossRefGoogle Scholar - [205]J.N.D. Gupta and S.S. Reddi, Improved dominance conditions for the three-machine flowshop scheduling problem,
*Operations Research*26 (1978), 200–203.MATHMathSciNetCrossRefGoogle Scholar - [206]M.X. Goemans, Improved approximation algorithms for scheduling with release dates,
*Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms*(1997), 591–598.Google Scholar - [207]M.X. Goemans and J. Kleinberg, An improved approximation ratio for the minimum latency problem,
*Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms*(1996), 152–157.Google Scholar - [208]L.A. Goldberg, M. Paterson, A. Srinivasan and E. Sweedyk, Better approximation guarantees for job shop scheduling,
*Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms*(1997), 599–608.Google Scholar - [209]T. Gonzalez, Optimal mean finish time preemptive schedules, Technical Report 220, Computer Science Department, Pennsylvania State University, USA, 1977.Google Scholar
- [210]T. Gonzalez, A note on open shop preemptive schedules, Unit execution time shop problems,
*IEEE Transactions on Computing*28 (1979), 782–786.MATHCrossRefGoogle Scholar - [211]T. Gonzalez, Unit execution time shop problems,
*Mathematics of Operations Research*7 (1982), 57–66.MATHMathSciNetCrossRefGoogle Scholar - [212]T. Gonzalez, O.H. Ibarra and S. Sahni, Bounds for LPT schedules on uniform processors,
*SIAM Journal on Computing*6 (1977), 155–166.MATHMathSciNetCrossRefGoogle Scholar - [213]T. Gonzalez and D.B. Johnson, A new algorithm for preemptive scheduling of trees,
*Journal of the Association for Computing Machinery*27 (1980), 287–312.MATHMathSciNetCrossRefGoogle Scholar - [214]T. Gonzalez, E.L. Lawler and S. Sahni, Optimal preemptive scheduling of two unrelated processors,
*ORSA Journal on Computing*2 (1990), 219–224.Google Scholar - [215]T. Gonzalez and S. Sahni, Open shop scheduling to minimize finish time,
*Journal of the Association for Computing Machinery*23 (1976), 665–679.MATHMathSciNetCrossRefGoogle Scholar - [216]T. Gonzalez and S. Sahni, Flow shop and job shop schedules: complexity and approximation,
*Operations Research*26 (1978), 36–52.MATHMathSciNetCrossRefGoogle Scholar - [217]T. Gonzalez and S. Sahni, Preemptive scheduling of uniform processor systems,
*Journal of the Association for Computing Machinery*25 (1978), 92–101.MATHMathSciNetCrossRefGoogle Scholar - [218]V.S. Gordon and V.S. Tanaev On minimax problems of scheduling theory for a single machine (in Russian),
*Vetsi Akademii Navuk BSSR. Ser. fizikamatematychnykh navuk*(1983) 3–9.Google Scholar - [219]S.K. Goyal and C. Sriskandarajah, No-wait scheduling: computational complexity and approximation algorithms,
*Opsearch*25 (1988), 220–244.MATHMathSciNetGoogle Scholar - [220]J. Grabowski, On two-machine scheduling with release and due dates to minimize maximum lateness,
*Opsearch*17 (1980), 133–154.MATHMathSciNetGoogle Scholar - [221]J. Grabowski, A new algorithm of solving the flow-shop problem, in G. Feichtinger and P. Kall (eds.),
*Operations Research in Progress*, Reidel, Dordrecht, 1982, 57–75.CrossRefGoogle Scholar - [222]J. Grabowski and A. Janiak, Job-shop scheduling with resource-time models of operations,
*European Journal of Operational Research*28 (1986), 58–73.MathSciNetCrossRefGoogle Scholar - [223]J. Grabowski, E. Nowicki and S. Zdrzalka, A block approach for single-machine scheduling with release dates and due dates,
*European Journal of Operational Research*26 (1986), 278–285.MATHMathSciNetCrossRefGoogle Scholar - [224]J. Grabowski, E. Skubalska and C. Smutnicki, On flow shop scheduling with release and due dates to minimize maximum lateness,
*Journal of the Operational Research Society*34 (1983), 615–620.MATHMathSciNetGoogle Scholar - [225]R.L. Graham, Bounds for certain multiprocessing anomalies,
*Bell System Technical Journal*45 (1966), 1563–1581.Google Scholar - [226]R.L. Graham, Bounds on multiprocessing timing anomalies,
*SIAM Journal on Applied Mathematics*17 (1969), 416–429.MATHMathSciNetCrossRefGoogle Scholar - [227]R.L. Graham, unpublished manuscript, see [335].Google Scholar
- [228]R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey,
*Annals of Operations Research*5 (1979), 287–326.MATHGoogle Scholar - [229]M.C. Gupta, Y.P. Gupta and A. Kumar, Minimizing flow time variance in a single machine system using genetic algorithms,
*European Journal of Operational Research*70 (1993), 289–303.MATHCrossRefGoogle Scholar - [230]D. Gusfield, Bounds for naive multiple machine scheduling with release times and deadlines,
*Journal of Algorithms*5 (1984), 1–6.MATHMathSciNetCrossRefGoogle Scholar - [231]L.A. Hall, A polynomial time approximation scheme for a constrained flow-shop scheduling problem,
*Mathematics of Operations Research*19 (1994), 68–85.MATHMathSciNetCrossRefGoogle Scholar - [232]L.A. Hall, Approximability of flow shop scheduling,
*Proceedings of the 36th IEEE Symposium on Foundations of Computer Science*(1995), 82–91.Google Scholar - [233]L.A. Hall, A.S. Schulz, D.B. Shmoys and J. Wein, Scheduling to minimize average completion time: Off-line and on-line approximation algorithms,
*Mathematics of Operations Research*22 (1997), 513–544.MATHMathSciNetCrossRefGoogle Scholar - [234]L.A. Hall and D.B. Shmoys, Approximation algorithms for constrained scheduling problems,
*Proceedings of the 30th IEEE Symposium on Foundations of Computer Science*(1989), 134–139.Google Scholar - [235]L.A. Hall and D.B. Shmoys, Jackson’s rule for one-machine scheduling: making a good heuristic better,
*Mathematics of Operations Research*17 (1992), 22–35.MATHMathSciNetCrossRefGoogle Scholar - [236]L.A. Hall, D.B. Shmoys and J. Wein, Scheduling to minimize average completion time: Off-line and on-line algorithms,
*Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms*(1996), 142–151.Google Scholar - [237]N.G. Hall, W. Kubiak and S.P. Sethi, Earliness-tardiness scheduling problems, II: deviation of completion times about a restrictive common due date,
*Operations Research*39 (1991), 847–856.MATHMathSciNetCrossRefGoogle Scholar - [238]N.G. Hall and M.E. Posner, Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date,
*Operations Research*39 (1991), 836–846.MATHMathSciNetCrossRefGoogle Scholar - [239]N.G. Hall and C. Sriskandarajah, A survey of machine scheduling with blocking and no-wait in process,
*Operations Research*44 (1996), 510–525.MATHMathSciNetCrossRefGoogle Scholar - [240]A.M.A. Hariri and C.N. Potts, An algorithm for single machine sequencing with release dates to minimize total weighted completion
*time*,*Discrete Applied Mathematics*5 (1983), 99–109.MATHCrossRefGoogle Scholar - [241]A.M.A. Hariri and C.N. Potts, Algorithms for two-machine flow-shop sequencing with precedence constraints,
*European Journal of Operational Research*17 (1984), 238–248.MATHMathSciNetCrossRefGoogle Scholar - [242]A.M.A. Hariri and C.N. Potts, A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop,
*European Journal of Operational Research*38 (1989), 228–237.MATHMathSciNetCrossRefGoogle Scholar - [243]A.M.A. Hariri and C.N. Potts, Heuristics for scheduling unrelated parallel machines.
*Computers and Operations Research*18 (1991), 323–331.MATHCrossRefGoogle Scholar - [244]A.M.A. Hariri and C.N. Potts, Single machine scheduling with deadlines to minimize the weighted number of tardy jobs.
*Management Science*40 (1994), 1712–1719.MATHCrossRefGoogle Scholar - [245]A.M.A. Hariri and C.N. Potts, Single machine scheduling with batch setup times to minimize maximum lateness,
*Annals of Operations Research*70 (1997), 75–92.MATHMathSciNetCrossRefGoogle Scholar - [246]A.M.A. Hariri, C.N. Potts and L.N. Van Wassenhove, Single machine scheduling to minimize total weighted late work,
*ORSA Journal on Computing*7 (1995), 232–242.MATHGoogle Scholar - [247]R. Haupt, A survey of priority rule-based scheduling,
*OR Spektrum*11 (1989), 3–16.MATHMathSciNetCrossRefGoogle Scholar - [248]N. Hefetz and I. Adiri, An efficient optimal algorithm for the two-machines, unit-time, job shop, schedule-length problem,
*Mathematics of Operations Research*7 (1982), 354–360.MATHCrossRefGoogle Scholar - [249]W.S. Herroelen, Resource-constrained project scheduling—the state of the art,
*Operational Research Quarterly*23 (1972), 261–275.MATHCrossRefGoogle Scholar - [250]W.S. Herroelen and E.L. Demeulemeester, Recent advances in branch-andbound procedures for resource-constrained project scheduling problems, in P. Chrétienne et al. (eds.)
*Proceedings of the Summer School on Scheduling Theory and Its Applications*, John Wiley & Sons, Chichester, 1995, 259–276.Google Scholar - [251]D.S. Hochbaum and D.B. Shmoys, Using dual approximation algorithms for scheduling problems: Theoretical and practical results,
*Journal of the Association for Computing Machinery*34 (1987), 144–162.MathSciNetCrossRefGoogle Scholar - [252]D.S. Hochbaum and D.B. Shmoys, A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximating approach,
*SIAM Journal on Computing*17 (1988), 539–551.MATHMathSciNetCrossRefGoogle Scholar - [253]J.E. Holsenback and R.M. Russell, A heuristic algorithm for sequencing on one machine to minimize total tardiness,
*Journal of the Operational Research Society*43 (1992), 53–62.MATHGoogle Scholar - [254]K.S. Hong and J.Y.-T. Leung, Preemptive scheduling with release times and deadlines,
*Journal of Real-Time Systems**1*(1989), 265–281.CrossRefGoogle Scholar - [255]K.S. Hong and J.Y.-T. Leung, On-line scheduling of real-time tasks,
*IEEE Transactions on Computing*41 (1992), 1326–1331.CrossRefGoogle Scholar - [256]J.A. Hoogeveen, Single-machine bicriteria scheduling,
*Ph.D. thesis*, Center for Mathematics and Computer Science, Amsterdam, The Netherlands, 1992.MATHGoogle Scholar - [257]J.A. Hoogeveen, Minimizing maximum promptness and maximum lateness on a single machine,
*Mathematics of Operations Research*21 (1996), 100–114.MATHMathSciNetCrossRefGoogle Scholar - [258]J.A. Hoogeveen, Single-machine scheduling to minimize a function or two or three maximum cost criteria,
*Journal of Algorithms*21 (1996), 415–433.MATHMathSciNetCrossRefGoogle Scholar - [259]J.A. Hoogeveen and T. Kawaguchi, Minimizing total completion time in a two-machine flowshop: Analysis of special cases,
*Proceedings of the 5th IPCO Conference*(1996), 374–388.Google Scholar - [260]J.A. Hoogeveen, J.K. Lenstra and B. Veltman, Three, four, five, six, or the complexity of scheduling with communication delays,
*Operations Research Letters*16 (1994), 129–137.MATHMathSciNetCrossRefGoogle Scholar - [261]J.A. Hoogeveen, J.K. Lenstra and B. Veltman, Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard,
*European Journal of Operational Research*89 (1996), 172–175.MATHGoogle Scholar - [262]J.A. Hoogeveen, H. Oosterhout and S.L. van de Velde, New lower and upper bounds for scheduling around a small common due date,
*Operations Research*42 (1994), 102–110.MATHCrossRefGoogle Scholar - [263]J.A. Hoogeveen, P. Schuurman and G.J. Woeginger, Non-approximability results for scheduling problems with minsum criteria, Technical Report Woe-15, Department of Mathematics, TU Graz, Graz, Austria, 1997.Google Scholar
- [264]J.A. Hoogeveen and S.L. van de Velde, Scheduling around a small common due date,
*European Journal of Operational Research*55 (1991), 237–242.MATHCrossRefGoogle Scholar - [265]J.A. Hoogeveen and S.L. van de Velde, Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time.
*Operations Research Letters*17 (1995), 205–208.MATHMathSciNetCrossRefGoogle Scholar - [266]J.A. Hoogeveen and S.L. van de Velde, Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems.
*Mathematical Programming*70 (1995), 173–190.MATHMathSciNetGoogle Scholar - [267]J.A. Hoogeveen and S.L. van de Velde, A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time,
*INFORMS Journal on Computing*8 (1996), 402–412.MATHCrossRefGoogle Scholar - [268]J.A. Hoogeveen and S.L. van de Velde, Earliness-tardiness scheduling around almost equal due date,
*INFORMS Journal on Computing*9 (1997), 92–99.MATHMathSciNetCrossRefGoogle Scholar - [269]J.A. Hoogeveen, S.L. van de Velde and B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processor allocations,
*Discrete Applied Mathematics*55 (1994), 259–272.MATHMathSciNetCrossRefGoogle Scholar - [270]J.A. Hoogeveen and A.P.A. Vestjens, Optimal on-line algorithms for single-machine scheduling,
*Proceedings of the 5th IPCO Conference*(1996), 404–414.Google Scholar - [271]J.A. Hoogeveen and G.J. Woeginger, Scheduling with controllable processing times, Manuscript, Department of Mathematics, TU Graz, Graz, Austria, 1998.Google Scholar
- [272]W.A. Horn, Single-machine job sequencing with treelike precedence ordering and linear delay penalties,
*SIAM Journal on Applied Mathematics*23 (1972), 189–202.MATHMathSciNetCrossRefGoogle Scholar - [273]W.A. Horn, Minimizing average flow time with parallel machines,
*Operations Research*21 (1973), 846–847.MATHCrossRefGoogle Scholar - [274]W.A. Horn, Some simple scheduling algorithms, Naval
*Research Logistics*Quarterly 21 (1974), 177–185.MATHMathSciNetGoogle Scholar - [275]E. Horowitz and S. Sahni, Exact and approximate algorithms for scheduling nonidentical processors,
*Journal of the Association for Computing Machinery*23 (1976), 317–327.MATHMathSciNetCrossRefGoogle Scholar - [276]E.C. Horvath, S. Lam and R. Sethi, A level algorithm for preemptive scheduling,
*Journal of the Association for Computing Machinery*24 (1977), 32–43.MATHMathSciNetCrossRefGoogle Scholar - [277]T.C. Hu, Parallel sequencing and assembly line problems,
*Operations Research*9 (1961), 841–848.MathSciNetCrossRefGoogle Scholar - [278]O.H. Ibarra and C.E. Kim, Heuristic algorithms for scheduling independent tasks on nonidentical processors,
*Journal of the Association for Computing Machinery*24 (1977), 280–289.MATHMathSciNetCrossRefGoogle Scholar - [279]O.H. Ibarra and C.E. Kim, Approximation algorithms for certain scheduling problems,
*Mathematics of Operations Research*3 (1978), 197–204.MATHMathSciNetCrossRefGoogle Scholar - [280]I. Ignall and L. Schrage, Applications of the branch-and-bound technique to some flow-shop scheduling problems,
*Operations Research*13 (1965), 400–412.MathSciNetCrossRefGoogle Scholar - [281]J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Science Research Project, University of California, Los Angeles, USA, 1955.Google Scholar
- [282]J.R. Jackson, An extension of Johnson’s result on job lot scheduling,
*Naval Research Logistics Quarterly*3 (1956), 201–203.CrossRefGoogle Scholar - [283]J.M. Jaffe, Efficient scheduling of tasks without full use of processor resources,
*Theoretical Computer Science*12 (1980), 1–17.MATHMathSciNetCrossRefGoogle Scholar - [284]J.M. Jaffe, An analysis of preemptive multiprocessor job scheduling,
*Mathematics of Operations Research*5 (1980), 415–521.MATHMathSciNetCrossRefGoogle Scholar - [285]A. Jakoby and R. Reischuk, The complexity of scheduling problems with communication delays for trees,
*Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory*(1992), 165–177.Google Scholar - [286]S.M. Johnson, Optimal two-and three-stage production schedules with setup times included,
*Naval Research Logistics Quarterly*1 (1954), 61–68.CrossRefGoogle Scholar - [287]H. Jung, L.M. Kirousis and P. Spirakis, Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays,
*Information and Computation*105 (1993), 94–104.MATHMathSciNetCrossRefGoogle Scholar - [288]B. Jurisch and W. Kubiak, Two-machine open shops with renewable resources,
*Operations Research*45 (1997), 544–552.MATHCrossRefGoogle Scholar - [289]B. Jurisch and W. Kubiak, Algorithms for minclique scheduling problems,
*Discrete Applied Mathematics*72 (1997), 115–139.MATHMathSciNetCrossRefGoogle Scholar - [290]H.G. Kahlbacher, SWEAT—A program for a scheduling problem with earliness and tardiness penalties,
*European Journal of Operational Research*43 (1989), 111–112.CrossRefGoogle Scholar - [291]H. Kamoun and C. Sriskandarajah, The complexity of scheduling jobs in repetitive manufacturing systems,
*European Journal of Operational Research*70 (1993), 350–364.MATHCrossRefGoogle Scholar - [292]J.J. Kanet, Minimizing the average deviation of jobs completion times about a common due date,
*Naval Research Logistics Quarterly*28 (1981), 643–651.MATHCrossRefGoogle Scholar - [293]D.R. Karger, S.J. Phillips and E. Torng, A better algorithm for an ancient scheduling problem,
*Journal of Algorithms*20 (1996), 400–430.MATHMathSciNetCrossRefGoogle Scholar - [294]R.M. Karp, Reducibility among combinatorial problems, in R.E. Miller and J.W. Thatcher (eds.)
*Complexity of Computer Computations*, Plenum Press, New York, 1972, 85–103.Google Scholar - [295]M.T. Kaufman, An almost-optimal algorithm for the assembly line scheduling problem,
*IEEE Transactions on Computing*C-23 (1974), 1169–1174.MATHMathSciNetCrossRefGoogle Scholar - [296]T. Kawaguchi and S. Kyan, Worst case bound of an LRF schedule for the mean weighted flow-time problem,
*SIAM Journal on Computing*15 (1986), 1119–1129.MATHMathSciNetCrossRefGoogle Scholar - [297]H. Kellerer, T. Tautenhahn and G.J. Woeginger, Approximability and nonapproximability results for minimizing total flow time on a single machine,
*Proceedings of the 28th Annual ACM Symposium on Theory of Computing*(1996), 418–426. To appear in*SIAM Journal on Computing*Google Scholar - [298]Y.-D. Kim, Heuristics for flowshop scheduling problems minimizing mean tardiness,
*Journal of the Operational Research Society*44 (1993), 19–28.MATHGoogle Scholar - [299]H. Kise, T. Ibaraki and H. Mine, Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times,
*Journal of the Operational Research Society of Japan*22 (1979), 205–224.MATHMathSciNetGoogle Scholar - [300]U. Kleinau, Two-machine shop scheduling problems with batch processing,
*Mathematical and Computer Modelling**17*(1993), 55–66.MATHMathSciNetCrossRefGoogle Scholar - [301]W.H. Kohler and K. Steiglitz, Exact, approximate and guaranteed accuracy algorithms for the flow-shop problem
*n/2/F/F*,*Journal of the Association for Computing Machinery*22 (1975), 106–114.MATHCrossRefGoogle Scholar - [302]C. Koulamas, The total tardiness problem: Review and extensions,
*Operations Research*42 (1994), 1025–1041.MATHMathSciNetCrossRefGoogle Scholar - [303]M.Y. Kovalyov, On one machine scheduling to minimize the number of late items and the total tardiness, Preprint N4, Institute of Engineering Cybernetics, Academy of Sciences of Byelorussian SSR, Minsk, Byelorussia, 1991.Google Scholar
- [304]M.Y. Kovalyov and W. Kubiak, A fully polynomial time approximation scheme for the weighted earliness-tardiness problem,
*Operations Research*, to appear.Google Scholar - [305]M.Y. Kovalyov, C.N. Potts and L.N. Van Wassenhove, A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work,
*Mathematics of Operations Research*19 (1994), 86–93.MATHMathSciNetCrossRefGoogle Scholar - [306]A. Krämer, Scheduling multiprocessor tasks on dedicated processors,
*Ph.D. thesis*, Fachbereich Mathematik/Informatik, Universität Osnabrück, Osnabrück, Germany, 1995.MATHGoogle Scholar - [307]S.A. Kravchenko and Y.N. Sotskov, Optimal makespan schedule for three jobs on two machines,
*ZOR — Mathematical Methods of Operations Research*43 (1996), 233–238.MATHMathSciNetCrossRefGoogle Scholar - [308]H. Krawczyk and M. Kubale, An approximation algorithm for diagnostic test scheduling in multicomputer systems,
*IEEE Transactions on Computing*34 (1985), 869–872.CrossRefGoogle Scholar - [309]M.J. Krone and K. Steiglitz, Heuristic-programming solution of a flowshopscheduling problem,
*Operations Research*22 (1974), 629–638.MATHCrossRefGoogle Scholar - [310]W. Kubiak, Zlozono66 Obliczeniowa Algorytmôw i Problembw Szeregowania Zadan przy Ograniczeniach Zasobowych (in Polish),
*Ph.D. thesis*, ICS-Polish Academy of Sciences, Warsaw, Poland, 1987.Google Scholar - [311]W. Kubiak, Completion time variance minimization on a single machine is difficult,
*Operations Research Letters*14 (1993), 49–59.MATHMathSciNetCrossRefGoogle Scholar - [312]W. Kubiak, C. Sriskandarajah and K. Zaras, A note on the complexity of open shop scheduling problems,
*INFOR*29 (1991), 284–294.MATHGoogle Scholar - [313]M. Kubale, Preemptive scheduling of two-processor tasks on dedicated processors (in Polish),
*Zeszyty Naukowe Politechniki Slgskiej. Seria Automatyka*100 /1082 (1990), 145–153.Google Scholar - [314]M. Kunde, Nonpreemptive LP-scheduling on homogeneous multiprocessor systems,
*SIAM Journal on Computing*10 (1981), 151–173.MATHMathSciNetCrossRefGoogle Scholar - [315]J. Labetoulle, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Preemptive scheduling of uniform machines subject to release dates, in W.R. Pulley-blank (ed.)
*Progress in Combinatorial Optimization*, Academic Press, New York, 1984, 245–261.Google Scholar - [316]B.J. Lageweg, J.K. Lenstra and A.H.G. Rinnooy Kan, Minimizing maximum lateness on one machine: computational experience and some applications,
*Statistica Neerlandica*30 (1976), 25–41.MATHMathSciNetCrossRefGoogle Scholar - [317]B.J. Lageweg, J.K. Lenstra and A.H.G. Rinnooy Kan, Job-shop scheduling by implicit enumeration,
*Management Science*24 (1977), 441–450.MATHMathSciNetCrossRefGoogle Scholar - [318]B.J. Lageweg, J.K. Lenstra and A.H.G. Rinnooy Kan, A general bounding scheme for the permutation flow-shop problem,
*Operations Research*26 (1978), 53–67.MATHCrossRefGoogle Scholar - [319]S. Lam and R. Sethi, Worst case analysis of two scheduling algorithms,
*SIAM Journal on Computing*6 (1977), 518–536.MATHMathSciNetCrossRefGoogle Scholar - [320]R.E. Larson, M.I. Dessouky and R.E. Devor, A forward-backward procedure for the single machine problem to minimize maximum lateness,
*HE Transactions**17*(1985), 252–260.Google Scholar - [321]E.L. Lawler, Optimal sequencing of a single machine subject to precedence constraints,
*Management Science*19 (1973), 544–546.MATHCrossRefGoogle Scholar - [322]E.L. Lawler, Sequencing to minimize the weighted number of tardy jobs,
*RAIRO Recherche opérationnelle*S10 (5) (1976), 27–33.MathSciNetGoogle Scholar - [323]E.L. Lawler, A `pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness,
*Annals of Operations Research*1 (1977), 331–342.MathSciNetGoogle Scholar - [324]E.L. Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints,
*Annals of Operations Research*2 (1978), 75–90.MATHMathSciNetGoogle Scholar - [325]E.L. Lawler, Preemptive scheduling of uniform parallel machines to minimize the weighted number of late jobs, Report BW105, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, 1979.Google Scholar
- [326]E.L. Lawler, Efficient implementation of dynamic programming algorithms for sequencing problems, Report BW106, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, 1979.Google Scholar
- [327]E.L. Lawler, A fully polynomial approximation scheme for the total tardiness problem,
*Operations Research Letters*1 (1982), 207–208.MATHCrossRefGoogle Scholar - [328]E.L. Lawler, Preemptive scheduling of precedence-constrained jobs on parallel machines, in M.A.H. Dempster, J.K. Lenstra and A.H.G. Rinnooy Kan (eds.)
*Deterministic and Stochastic Scheduling*, Reidel, Dordrecht, 1982, 101–123.Google Scholar - [329]E.L. Lawler, Recent results in the theory of machine scheduling, In A. Bachem, M. Grötschel and B. Korte (eds.)
*Mathematical Programming: The State of the Art—Bonn**1982*, Springer, Berlin, 1983, 202–234.CrossRefGoogle Scholar - [330]E.L. Lawler, Scheduling a single machine to minimize the number of late jobs, Report No.UCB/CSD 83/139, Computer Science Division, University of California, Berkeley, USA, 1983.Google Scholar
- [331]E.L. Lawler, A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs,
*Annals of Operations Research*26 (1990), 125–133.MATHMathSciNetCrossRefGoogle Scholar - [332]E.L. Lawler, Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `tower of sets’ property,
*Mathematical and Computer Modelling*20 (1994), 91–106.MATHMathSciNetCrossRefGoogle Scholar - [333]E.L. Lawler and J. Labetoulle, On preemptive scheduling of unrelated parallel processors by linear programming,
*Journal of the Association for Computing Machinery*25 (1978), 612–619.MATHMathSciNetCrossRefGoogle Scholar - [334]E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Minimizing maximum lateness in a two-machine open shop,
*Mathematics of Operations Research*6 (1981), 153–158. Erratum:*Mathematics of Operations Research*7 (1982), 635.MathSciNetCrossRefGoogle Scholar - [335]E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in S. Graves, A.H.G. Rinnooy Kan and P. Zipkin (eds.)
*Handbooks in Operations Research and Management Science*,*Volume.4*,*Logistics of Production and Inventory*, North Holland, Amsterdam, 1993, 445–522.Google Scholar - [336]E.L. Lawler, M.G. Luby and V.V. Vazirani, Scheduling open shops with parallel machines,
*Operations Research Letters**1*(1982), 161–164.MATHCrossRefGoogle Scholar - [337]E.L. Lawler and C.U. Martel, Preemptive scheduling of two uniform machines to minimize the number of late jobs,
*Operations Research*37 (1989), 314–318.MATHMathSciNetCrossRefGoogle Scholar - [338]E.L. Lawler and J.M. Moore, A functional equation and its application to resource allocation and sequencing problems,
*Management Science*16 (1969), 77–84.MATHCrossRefGoogle Scholar - [339]S. Lawrence, Resource constrained scheduling: an experimental investigation of heuristic scheduling techniques, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, USA, 1984.Google Scholar
- [340]C.-Y. Lee, T.C.E. Cheng and B.M.T. Lin, Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem,
*Management Science*39 (1993), 616–625.MATHCrossRefGoogle Scholar - [341]C.-Y. Lee and S.J. Kim, Parallel genetic algorithms for the earliness tardiness job scheduling problem with general penalty weights,
*Computers and Industrial Engineering*28 (1995), 231–243.CrossRefGoogle Scholar - [342]C.-Y. Lee and G.L. Vairaktarakis, Complexity of single machine hierarchical scheduling: A survey, in P.M. Pardalos (ed.)
*Complexity in Numerical Optimization*, World Scientific Publishing Company, 1993, 269–298.Google Scholar - [343]T. Leighton, B. Maggs and S. Rao, Packet routing and job shop scheduling in O(Congestion+Dilation) steps,
*Combinatorica*14 (1994), 167–186.MATHMathSciNetCrossRefGoogle Scholar - [344]T. Leighton, B. Maggs and A. Richa, Fast algorithms for finding 0(Congestion+Dilation) packet routing schedules, Technical Report CMU-CS-96152, School of Computer Science, Carnegie Mellon University, Pittsburgh, USA, 1996.Google Scholar
- [345]J.K. Lenstra, unpublished manuscript.Google Scholar
- [346]J.K. Lenstra and A.H.G. Rinnooy Kan, Complexity of scheduling under precedence constraints,
*Operations Research*26 (1978), 22–35.MATHMathSciNetCrossRefGoogle Scholar - [347]J.K. Lenstra and A.H.G. Rinnooy Kan, Computational complexity of discrete optimization problems,
*Annals of Operations Research*4 (1979), 121–140.MATHGoogle Scholar - [348]J.K. Lenstra and A.H.G. Rinnooy Kan, Complexity results for scheduling chains on a single machine,
*European Journal of Operational Research*4 (1980), 270–275.MATHMathSciNetCrossRefGoogle Scholar - [349]J.K. Lenstra, A.H.G. Rinnooy Kan and P. Brucker, Complexity of machine scheduling problems,
*Annals of Operations Research*1 (1977), 343–362.Google Scholar - [350]J.K. Lenstra, D.B. Shmoys and É. Tardos, Approximation algorithms for scheduling unrelated parallel machines,
*Mathematical Programming*46 (1990), 259–271.MATHMathSciNetCrossRefGoogle Scholar - [351]J.K. Lenstra, M. Veldhorst and B. Veltman, The complexity of scheduling trees with communication delays,
*Journal of Algorithms*20 (1996), 157–173.MATHMathSciNetCrossRefGoogle Scholar - [352]S. Leonardi and D. Raz, Approximating total flow time on parallel machines,
*Proceedings of the 29th Annual ACM Symposium on Theory of Computing*(1997), 110–119.Google Scholar - [353]V. Lev and I. Adiri, V-shop scheduling,
*European Journal of Operational Research*18 (1984), 51–56.MATHMathSciNetCrossRefGoogle Scholar - [354]C.-L. Li, Z.L. Chen and T.C.E. Cheng, A note on one-processor scheduling with asymmetric earliness and tardiness penalties,
*Operations Research Letters*13 (1993), 45–48.MATHMathSciNetCrossRefGoogle Scholar - [355]R. Li and L. Shi, An on-line algorithm for some uniform processor scheduling,
*SIAM Journal on Computing*(1998), to appear.Google Scholar - [356]C.Y. Liu and R.L. Bulfin, On the complexity of preemptive open-shop scheduling problems,
*Operations Research Letters*4 (1985), 71–74.MATHMathSciNetCrossRefGoogle Scholar - [357]C.Y. Liu and R.L. Bulfin, Scheduling open shops with unit execution times to minimize functions of due dates,
*Operations Research*36 (1988), 553–559.MathSciNetCrossRefGoogle Scholar - [358]J.W.S. Liu and C.L. Liu, Bounds on scheduling algorithms for heterogeneous computing systems, in J.L. Rosenfeld (ed.)
*Information Processing*, North-Holland, Amsterdam, 1974, 349–353.Google Scholar - [359]J.W.S. Liu and C.L. Liu, Bounds on scheduling algorithms for heterogeneous computing systems, Technical Report UIUCDCS-R-74–632, Department of Computer Science, University of Illinois at Urbana-Champaign, USA, 1974.Google Scholar
- [360]J.W.S. Liu and C.L. Liu, Performance analysis of heterogeneous multiprocessor computing systems, in E. Gelenbe and R. Mahl (eds.)
*Computer Architectures and Networks*, North-Holland, Amsterdam, 1974, 331–343.Google Scholar - [361]J.W.S. Liu and A. Yang, Optimal scheduling of independent tasks on heterogeneous computing systems,
*Proceedings of the ACM Annual Conference*(1974), 38–45.Google Scholar - [362]E.L. Lloyd, Concurrent task systems,
*Operations Research*29 (1981), 85–92.MathSciNetCrossRefGoogle Scholar - [363]I.N. Lushchakova and V.A. Strusevich, The complexity of open shop scheduling under resource constraints (in Russian), in
*Solution Methods for Extremal Problems*, Minsk, 1989, 57–65.Google Scholar - [364]I.N. Lushchakova and V.A. Strusevich, Two-stage open shop systems with resource constraints (in Russian),
*Zhurnal Vychistlitel’noj Matematiki i Matematicheskoj Fiziki*29 (1989), 1393–1407.MATHMathSciNetGoogle Scholar - [365]W. Mao, R.K. Kincaid and A. Rifkin, On-line algorithms for a single machine scheduling problem, in S.G. Nash and A. Sofer (eds.),
*The Impact of Emerging Technologies on Computer Science and Operations Research*, Kluwer Academic Publishers, Boston, 1995, 157–173.CrossRefGoogle Scholar - [366]C.U. Martel, Preemptive scheduling with release times, deadlines and due times,
*Journal of the Association for Computing Machinery*29 (1982), 812–829.MATHMathSciNetCrossRefGoogle Scholar - [367]S. Martello, F. Soumis and P. Toth, Exact and approximation algorithms for makespan minimization on unrelated parallel machines,
*Discrete Applied Mathematics*75 (1997), 169–188.MATHMathSciNetCrossRefGoogle Scholar - [368]P. Martin, D.B. Shmoys, A new approach to computing schedules for the job shop scheduling problem,
*Proceedings of the 5th IPCO Conference*(1996), 389–403.Google Scholar - [369]A.J. Mason, Genetic algorithms and scheduling problems,
*Ph.D. thesis*, Department of Engineering, University of Cambridge, U.K., 1992.Google Scholar - [370]A.J. Mason and E.J. Anderson, Minimizing flow time on a single machine with job classes and setup times,
*Naval Research Logistics*38 (1991), 333–350.MATHMathSciNetCrossRefGoogle Scholar - [371]H. Matsuo, Cyclic sequencing in the two-machine permutation flow shop: complexity, worst-case and average-case analysis,
*Naval Research Logistics Quarterly*37 (1990), 679–694.MATHMathSciNetCrossRefGoogle Scholar - [372]H. Matsuo, C.J. Suh and R.S. Sullivan, A controlled search simulated annealing method for the single machine weighted tardiness problem, Working paper 87–12–2, Department of Management, The University of Texas at Austin, TX, USA, 1987.Google Scholar
- [373]H. Matsuo, C.J. Suh and R.S. Sullivan, A controlled search simulated annealing method for the general jobshop scheduling problem, Working paper 03–44–88, Department of Management, The University of Texas at Austin, TX, USA, 1988.Google Scholar
- [374]S.T. McCormick and M.L. Pinedo, Scheduling n independent jobs on m uniform machines with both flow time and makespan objectives: A parametric analysis,
*ORSA Journal on Computing*7 (1995), 63–77.MATHGoogle Scholar - [375]G.B. McMahon, Optimal production schedules for flow shops,
*Canadian Operational Research Society Journal**7*(1969), 141–151.MathSciNetGoogle Scholar - [376]G.B. McMahon and P.G. Burton, Flow-shop scheduling with the branch-andbound method,
*Operations Research*15 (1967), 473–481.CrossRefGoogle Scholar - [377]G.B. McMahon and M. Florian, On scheduling with ready times and due dates to minimize maximum lateness,
*Operations Research*23 (1975), 475–482.MATHCrossRefGoogle Scholar - [378]R. McNaughton, Scheduling with deadlines and loss functions,
*Management Science*6 (1959), 1–12.MATHMathSciNetCrossRefGoogle Scholar - [379]J. Mittenthal, M. Raghavachari and A.I. Rana, A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions,
*Computers and Operations Research*20 (1993), 103–111.MATHCrossRefGoogle Scholar - [380]R.H. Möhring, M.W. Schäffter and A.S. Schulz, Scheduling jobs with communication delays: using infeasible solutions for approximation,
*Proceedings of the 4th Annual European Symposium on Algorithms*(1996), 76–90.Google Scholar - [381]C.L. Monma, Linear-time algorithms for scheduling on parallel processors,
*Operations Research*30 (1982), 116–124.MATHCrossRefGoogle Scholar - [382]C.L. Monma and C.N. Potts, On the complexity of scheduling with batch setup times,
*Operations Research*37 (1989), 798–804.MATHMathSciNetCrossRefGoogle Scholar - [383]C.L. Monma and C.N. Potts, Analysis of heuristics for preemptive parallel machine scheduling with batch setup times,
*Operations*Research4193 981–993.Google Scholar - [384]C.L. Monma and A.H.G. Rinnooy Kan, A concise survey of efficiently solvable special cases of the permutation flow-shop problem,
*RAIRO Recherche opérationnelle**17*(1983), 105–119.MATHGoogle Scholar - [385]J.M. Moore, An n job, one machine sequencing algorithm for minimizing the number of late jobs,
*Management Science*15 (1968), 102–109.MATHCrossRefGoogle Scholar - [386]J.F. Morrison, A note on LPT scheduling,
*Operations Research Letters*7 (1988), 77–79.MATHMathSciNetCrossRefGoogle Scholar - [387]R. Motwani, S. Phillips and E. Torng, Non-clairvoyant scheduling,
*Theoretical Computer Science*130 (1994), 17–47.MATHMathSciNetCrossRefGoogle Scholar - [388]J.H. Muller and J. Spinrad, Incremental modular decomposition.
*Journal of the Association for Computing Machinery*36 (1989), 1–19.MATHMathSciNetCrossRefGoogle Scholar - [389]A. Munier and C. Hanen, Using duplication for scheduling unitary tasks on m processors with unit communication delays,
*Theoretical Computer Science*178 (1997), 119–127.MATHMathSciNetCrossRefGoogle Scholar - [390]A. Munier and C. Hanen, An approximation algorithm for scheduling unitary tasks on m processors with communication delays, Internal Report LITP 12, Université P. et M. Curie, Paris, France, 1995.Google Scholar
- [391]A. Munier and J.-C. König, A heuristic for a scheduling problem with communication delays,
*Operations Research*45 (1997), 145–147.MATHCrossRefGoogle Scholar - [392]R.R. Muntz and E.G. Coffman, Jr., Optimal scheduling on two-processor systems,
*IEEE Transactions on Computing*C-18 (1969), 1014–1020.MATHMathSciNetCrossRefGoogle Scholar - [393]R.R. Muntz and E.G. Coffman, Jr., Preemptive scheduling of real tasks on multiprocessor systems,
*Journal of the Association for Computing Machinery*17 (1970), 324–338.MATHMathSciNetCrossRefGoogle Scholar - [394]R. Nakano and T. Yamada, Conventional genetic algorithm for job shop problems, in R.K. Belew and L.B. Booker (eds.)
*Proceedings of the Fourth International Conference on Genetic Algorithms*, Morgan Kaufmann, San Mateo, 1991, 474–479.Google Scholar - [395]M. Nawaz, E.E. Enscore, Jr., and I. Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem,
*OMEGA*11 (1983), 91–95.CrossRefGoogle Scholar - [396]E. Németi, Das reihenfolgeproblem in der fertinungsprogrammierung and linearplanung mit logischen bedingungen,
*Mathematica (Cluj)*6 (1964), 87–99.Google Scholar - [397]Ju.D. Neumytov and S.V. Sevastianov, An approximation algorithm with best possible bound for the counter routes problem with three machines (in Russian),
*Upravlyaemye Sistemy*31 (1993), 53–65.Google Scholar - [398]E. Nowicki and C. Smutnicki, On lower bounds on the minimum maximum lateness on one machine subject to release dates,
*Opsearch*24 (1987), 106–110.MATHMathSciNetGoogle Scholar - [399]E. Nowicki and C. Smutnicki, Worst-case analysis of an approximation algorithm for flow-shop scheduling,
*Operations Research Letters*8 (1989), 171–177.MATHMathSciNetCrossRefGoogle Scholar - [400]E. Nowicki and C. Smutnicki, An approximation algorithm for single-machine scheduling problem with release times and delivery times,
*Discrete Applied Mathematics*48 (1993), 69–79.MathSciNetCrossRefGoogle Scholar - [401]E. Nowicki and C. Smutnicki, A fast tabu search algorithm for the permutation flow shop problem,
*European Journal of Operational Research*91 (1996), 160–175.MATHCrossRefGoogle Scholar - [402]E. Nowicki and C. Smutnicki, A fast taboo search algorithm for the job shop problem,
*Management Science*42 (1996), 797–813.MATHCrossRefGoogle Scholar - [403]E. Nowicki and S. Zdrzalka, A note on minimizing maximum lateness in a one-machine sequencing problem with release dates,
*European Journal of Operational Research*23 (1986), 266–267.MATHMathSciNetCrossRefGoogle Scholar - [404]E. Nowicki and S. Zdrzalka, A two-machine flow shop scheduling problem with controllable job processing times,
*European Journal of Operational Research*34 (1988), 208–220.MATHMathSciNetCrossRefGoogle Scholar - [405]E. Nowicki and S. Zdrzalka, A survey of results for sequencing problems with controllable processing times,
*Discrete Applied Mathematics*26 (1990), 271–287.MATHMathSciNetCrossRefGoogle Scholar - [406]E. Nowicki and S. Zdrzalka, A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times,
*Discrete Applied Mathematics*63 (1995), 237–256.MATHMathSciNetCrossRefGoogle Scholar - [407]F.A. Ogbu and D.K. Smith, The application of the simulated annealing algorithm to the solution of the nimiCm. flowshop problem,
*Computers and Operations Research*17 (1990), 243–253.MATHMathSciNetCrossRefGoogle Scholar - [408]F.A. Ogbu and D.K. Smith, Simulated annealing for the permutation flow-shop problem,
*OMEGA*19 (1991), 64–67.CrossRefGoogle Scholar - [409]I.H. Osman and C.N. Potts, Simulated annealing for permutation flow-shop scheduling,
*OMEGA*17 (1989), 551–557.CrossRefGoogle Scholar - [410]S.S. Panwalkar and R. Rajagopalan, Single-machine sequencing with controllable processing times,
*European Journal of Operational Research*59 (1992), 298–302.MATHCrossRefGoogle Scholar - [411]S.S. Panwalkar, M.L. Smith and C.P. Koulamas, A heuristic for the single machine tardiness problem,
*European Journal of Operational Research*70 (1993), 304–310.MATHCrossRefGoogle Scholar - [412]S.S. Panwalkar, M.L. Smith and A. Seidmann, Common due date assignment to minimize total penalty for the one machine sequencing problem,
*Operations Research*30 (1982), 391–399.MATHCrossRefGoogle Scholar - [413]C.H. Papadimitriou,
*Computational Complexity*, Addison-Wesley, 1994.MATHGoogle Scholar - [414]C.H. Papadimitriou and P.C. Kannelakis, Flow shop scheduling with limited temporary storage,
*Journal of the Association for Computing Machinery*27 (1980), 533–549.MATHMathSciNetCrossRefGoogle Scholar - [415]C.H. Papadimitriou and M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms,
*SIAM Journal on Computing*19 (1990), 322–328.MATHMathSciNetCrossRefGoogle Scholar - [416]E. Pesch, Machine learning by schedule decomposition, Working Paper, Faculty of Economics and Business Administration, University of Limburg, Maastricht, The Netherlands, 1993.Google Scholar
- [417]C. Phillips, C. Stein and J. Wein, Scheduling jobs that arrive over time,
*Proceedings of the 4th Workshop on Algorithms and Data Structures*(1995), 86–97. To appear in*Mathematical Programming*Google Scholar - [418]C. Picouleau, Etude de problèmes les systèmes distribués,
*Ph.D. thesis*, Univ. Pierre et Marie Curie, Paris, France, 1992.Google Scholar - [419]C. Picouleau, New complexity results on scheduling with small communication delays,
*Discrete Applied Mathematics*60 (1995), 331–342.MATHMathSciNetCrossRefGoogle Scholar - [420]M.E. Posner, Minimizing weighted completion times with deadlines,
*Operations Research*33 (1985), 562–574.MATHMathSciNetCrossRefGoogle Scholar - [421]C.N. Potts, The job-machine scheduling problem,
*Ph.D. thesis*, University of Birmingham, U.K., 1974.Google Scholar - [422]C.N. Potts, An algorithm for the single machine sequencing problem with precedence constraints,
*Mathematical Programming Study*13 (1980), 78–87.MATHMathSciNetGoogle Scholar - [423]C.N. Potts, An adaptive branching rule for the permutation flow-shop problem,
*European Journal of Operational Research*5 (1980), 19–25.MATHMathSciNetCrossRefGoogle Scholar - [424]C.N. Potts, Analysis of a heuristic for one machine sequencing with release dates and delivery times,
*Operations Research*28 (1980), 1436–1441.MATHMathSciNetCrossRefGoogle Scholar - [425]C.N. Potts, A Lagrangean based branch and bound algorithm for single machine sequencing with precedence constraints to minimize total weighted completion time,
*Management Science*31 (1985), 1300–1311.MATHMathSciNetCrossRefGoogle Scholar - [426]C.N. Potts, Analysis of a linear programming heuristic for scheduling unrelated parallel machines,
*Discrete Applied Mathematics*10 (1985), 155–164.MATHMathSciNetCrossRefGoogle Scholar - [427]C.N. Potts, Analysis of heuristics for two-machine flow-shop sequencing subject to release dates,
*Mathematics of Operations Research*10 (1985), 576–584.MATHMathSciNetCrossRefGoogle Scholar - [428]C.N. Potts, S.V. Sevastianov, V.A. Strusevich, L.N. Van Wassenhove and C.M. Zwaneveld, The two-stage assembly scheduling problem: complexity and approximation,
*Operations Research*43 (1995), 346–355.MATHMathSciNetCrossRefGoogle Scholar - [429]C.N. Potts, D.B. Shmoys and D.P. Williamson, Permutation vs. non-permutation flow shop schedules,
*Operations Research Letters*10 (1991), 281–284.MathSciNetCrossRefGoogle Scholar - [430]C.N. Potts and L.N. Van Wassenhove, A decomposition algorithm for the single machine total tardiness problem,
*Operations Research Letters*1 (1982), 177–181.MATHCrossRefGoogle Scholar - [431]C.N. Potts and L.N. Van Wassenhove, An algorithm for single machine sequencing with deadlines to minimize total weighted completion time,
*European Journal of Operational Research*12 (1983), 379–387.MATHCrossRefGoogle Scholar - [432]C.N. Potts and L.N. Van Wassenhove, A branch and bound algorithm for the total weighted tardiness problem,
*Operations Research*33 (1985), 363–377.MATHCrossRefGoogle Scholar - [433]C.N. Potts and L.N. Van Wassenhove, Dynamic programming and decomposition approaches for the single machine total tardiness problem,
*European Journal of Operational Research*32 (1987), 404–414.CrossRefGoogle Scholar - [434]C.N. Potts and L.N. Van Wassenhove, Algorithms for scheduling a single machine to minimize the weighted number of late jobs,
*Management Science*34 (1988), 843–858.MATHMathSciNetCrossRefGoogle Scholar - [435]C.N. Potts and L.N. Van Wassenhove, Single machine tardiness sequencing heuristics,
*IEE Transactions*23 (1991), 346–354.CrossRefGoogle Scholar - [436]C.N. Potts and L.N. Van Wassenhove, Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity,
*Journal of the Operational Research Society*43 (1992), 395–406.MATHGoogle Scholar - [437]C.N. Potts and L.N. Van Wassenhove, Single machine scheduling to minimize total late work,
*Operations Research*40 (1992), 586–595.MATHMathSciNetCrossRefGoogle Scholar - [438]C.N. Potts and L.N. Van Wassenhove, Approximation algorithms for scheduling a single machine to minimize total late work,
*Operations Research Letters*11 (1992), 261–266.MATHMathSciNetCrossRefGoogle Scholar - [439]M. Queyranne, Personal communication cited in [233].Google Scholar
- [440]M. Queyranne and A.S. Schulz, Polyhedral approaches to machine scheduling, Preprint No. 408/1994, Department of Mathematics, Technical University of Berlin, Berlin, Germany, 1994. To appear
*in Mathematical Programming*Google Scholar - [441]M. Queyranne and Y. Wang, Single-machine scheduling polyhedra with precedence constraints,
*Mathematics of Operations Research*16 (1991), 1–20. Erratum:*Mathematics of Operations Research*20 (1995), 768.MATHMathSciNetCrossRefGoogle Scholar - [442]M. Queyranne and Y. Wang, A cutting-plane procedure for precedence-constrained single-machine scheduling. Working paper, University of British Columbia, Vancouver, Canada, 1991.Google Scholar
- [443]V.J. Rayward-Smith, The complexity of preemptive scheduling given inter-processor communication delays,
*Information Processing Letters*25 (1987), 123–125.MathSciNetCrossRefGoogle Scholar - [444]V.J. Rayward-Smith, UET Scheduling with unit interprocessor communication delays,
*Discrete Applied Mathematics*18 (1987), 55–71.MATHMathSciNetCrossRefGoogle Scholar - [445]C.R. Reeves, Improving the efficiency of tabu search for machine sequencing problems, Journal of the Operational Research Society 44 (1993), 375–382.MATHGoogle Scholar
- [446]C.R. Reeves, A genetic algorithm for flowshop sequencing,
*Computers and Operations Research*22 (1995), 5–13.MATHCrossRefGoogle Scholar - [447]A.H.G. Rinnooy Kan, B.J. Lageweg and J.K. Lenstra, Minimizing total costs in one-machine scheduling,
*Operations Research*23 (1975), 908–927.MATHMathSciNetCrossRefGoogle Scholar - [448]H. Röck, The three-machine no-wait flow shop is NP-complete,
*Journal of the Association for Computing Machinery*31 (1981), 336–345.CrossRefGoogle Scholar - [449]H. Röck, Some new results in flow shop scheduling,
*ZOR-Mathematical Methods of Operations Research*28 (1984), 1–16.MATHGoogle Scholar - [450]H. Röck and G. Schmidt, Machine aggregation heuristics in shop-scheduling,
*Methods of Operations Research*45 (1983), 303–314.MATHGoogle Scholar - [451]G. Rote and G.J. Woeginger, Time complexity and linear-time approximation of the ancient two machine flow shop, Technical Report Woe-14, Department of Mathematics, TU Graz, Graz, Austria, 1997.Google Scholar
- [452]M.H. Rothkopf, Scheduling independent tasks on parallel processors,
*Management Science*12 (1966), 437–447.MathSciNetCrossRefGoogle Scholar - [453]M.H. Rothkopf and S.A. Smith, There are no undiscovered priority index rules for minimizing total delay costs,
*Operations Research*32 (1984), 451–456.MATHMathSciNetCrossRefGoogle Scholar - [454]F.M. Ruiz Diaz and S. French, A note on SPT scheduling of a single machine with controllable processing times, Note 154, Department of Decision Theory, University of Manchester, Manchester, UK, 1984.Google Scholar
- [455]R.M. Russell and J.E. Holsenback, Evaluation of leading heuristics for the single machine tardiness problem,
*European Journal of Operational Research*96 (1997), 538–545.MATHCrossRefGoogle Scholar - [456]R.M. Russell and J.E. Holsenback, Evaluation of greedy, myopic and less-greedy heuristics for the single machine total tardiness problem,
*Journal of the Operational Research Society*48 (1997), 640–646.MATHGoogle Scholar - [457]S. Sahni, Algorithms for scheduling independent tasks,
*Journal of the Association for Computing Machinery*23 (1976), 116–127.MATHMathSciNetCrossRefGoogle Scholar - [458]S. Sahni, Preemptive scheduling with due dates,
*Operations Research*27 (1979), 925–934.MATHMathSciNetCrossRefGoogle Scholar - [459]S. Sahni and Y. Cho, Nearly on line scheduling of a uniform processor system with release times,
*SIAM Journal on Computing*8 (1979), 275–285.MATHMathSciNetCrossRefGoogle Scholar - [460]S. Sahni and Y. Cho, Complexity of scheduling shops with no wait in process,
*Mathematics of Operations Research*4 (1979), 448–457.MATHMathSciNetCrossRefGoogle Scholar - [461]S. Sahni and Y. Cho, Scheduling independent tasks with due times on a uniform processor system,
*Journal of the Association for Computing Machinery*27 (1980), 550–563.MathSciNetCrossRefGoogle Scholar - [462]S.C. Sarin, S. Ahn and A.B. Bishop, An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtime,
*International Journal of Production Research*26 (1988), 1183–1191.MATHCrossRefGoogle Scholar - [463]J.P. Schmidt, A. Siegel and A. Srinivasan, Chernoff-Hoeffding bounds for applications with limited independence,
*SIAM Journal on Discrete Mathematics*8 (1995), 223–250.MATHMathSciNetCrossRefGoogle Scholar - [464]L. Schrage, A proof of the shortest remaining processing time processing discipline,
*Operations Research*16 (1968), 687–690.MATHCrossRefGoogle Scholar - [465]L. Schrage, Solving resource-constrained network problems by implicit enumeration—nonpreemptive case,
*Operations Research*18 (1970), 263–278.MATHMathSciNetCrossRefGoogle Scholar - [466]L. Schrage, Obtaining optimal solutions to resource constrained network scheduling problems, Unpublished manuscript, 1971.Google Scholar
- [467]L. Schrage and K.R. Baker, Dynamic programming solution of sequencing problems with precedence constraints,
*Operations Research*26 (1978), 444–449.MATHCrossRefGoogle Scholar - [468]A.S. Schulz, Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds,
*Proceedings of the 5th IPCO Conference*(1996), 301–315.Google Scholar - [469]J.M.J. Schutten, S.L. van de Velde and W.H.M. Zijm, Single-machine scheduling with release dates, due dates and family setup times,
*Management Science*42 (1996), 1165–1174.MATHCrossRefGoogle Scholar - [470]P. Schuurman and G.J. Woeginger, A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem, Technical Report Woe-01, Department of Mathematics, TU Graz, Graz, Austria, 1997. To appear in Theoretical Computer Science.Google Scholar
- [471]P. Schuurman and G.J. Woeginger, Approximation algorithms for the multiprocessor open shop problem, Technical Report Woe-13, Department of Mathematics, TU Graz, Graz, Austria, 1997.Google Scholar
- [472]R. Sethi, On the complexity of mean flow time scheduling,
*Mathematics of Operations Research*2 (1977), 320–330.MATHMathSciNetCrossRefGoogle Scholar - [473]S.V. Sevastianov, Approximation algorithms for Johnson’s and vector summation problems (in Russian),
*Upravlyaemye Sistemy*20 (1980), 64–73.Google Scholar - [474]S.V. Sevastianov, Some generalizations of the Johnson problem (in Russian),
*Upravlyaemye Sistemy*21 (1981), 45–61.Google Scholar - [475]S.V. Sevastianov, Algorithms with estimates for the Johnson’s and Akers-Friedman problems in the case of three machines (in Russian),
*Upravlyaemye Sistemy*22 (1982), 51–57.Google Scholar - [476]S.V. Sevastianov, On some geometric methods in scheduling theory: a survey,
*Discrete Applied Mathematics*55 (1994), 59–82.MathSciNetCrossRefGoogle Scholar - [477]S.V. Sevastianov, Vector summation in Banach space and polynomial time algorithms for flow shops and open shops,
*Mathematics of Operations Research*20 (1995), 90–103.MathSciNetCrossRefGoogle Scholar - [478]S.V. Sevastianov, Nonstrict vector summation in multi-operation scheduling, Technical Report COSOR 95–37, Department of Mathematics and Computing, TU Eindhoven, Eindhoven, The Netherlands, 1995.Google Scholar
- [479]S.V. Sevastianov and G.J. Woeginger, Makespan minimization in preemptive two machine job shops,
*Computing*60 (1998), 73–79.MathSciNetCrossRefGoogle Scholar - [480]S.V. Sevastianov and G.J. Woeginger, Makespan minimization in open shops: a polynomial time approximation scheme,
*Mathematical Programming*(1998), to appear.Google Scholar - [481]J. Sgall, On-line scheduling, in A. Fiat and G.J. Woeginger (eds.)
*On-line Algorithms: The State of the Art*, Springer, 1998.Google Scholar - [482]N.V. Shaklevich, J.A. Hoogeveen and M. Pinedo, Minimizing total weighted completion time in a proportionate flow shop, Technical Report COSOR 9603, Department of Mathematics and Computing, TU Eindhoven, Eindhoven, The Netherlands, 1996.Google Scholar
- [483]N.V. Shaklevich and Y.N. Sotskov, Scheduling two jobs with fixed and non-fixed routes,
*Computing*52 (1994), 17–30.MathSciNetCrossRefGoogle Scholar - [484]N.V. Shaklevich and V.A. Strusevich, Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function,
*European Journal of Operational Research*70 (1993), 391–404.CrossRefGoogle Scholar - [485]A.H. Sharary and N. Zaguia, Minimizing the number of tardy jobs in single machine sequencing,
*Discrete Applied Mathematics*117 (1993), 215–223.MATHMathSciNetCrossRefGoogle Scholar - [486]D.B. Shmoys, C. Stein and J. Wein, Improved approximation algorithms for shop scheduling problems,
*SIAM Journal on Computing*23 (1994), 617–632.MATHMathSciNetCrossRefGoogle Scholar - (487]D.B. Shmoys and É. Tardos, An approximation algorithm for the generalized assignment problem,
*Mathematical Programming*62 (1993), 461–474.MATHMathSciNetCrossRefGoogle Scholar - [488]D.B. Shmoys, J. Wein and D.P. Williamson, Scheduling parallel machines on-line,
*SIAM Journal on Computing*24 (1995), 1313–1331.MATHMathSciNetCrossRefGoogle Scholar - [489]J. Shwimer, On the N-jobs, one machine, sequence-independent scheduling problem with penalties: A branch-and-bound solution,
*Management Science*18B (1972), 301–313.MathSciNetGoogle Scholar - [490]J.B. Sidney, An extension of Moore’s due date algorithm, in S.E. Elmaghraby (ed.)
*Symposium on the Theory of Scheduling and its Applications*, Lecture Notes in Economics and Mathematical Systems, Volume 86, Springer, Berlin, 1973, 393–398.CrossRefGoogle Scholar - [491]J.B. Sidney, Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs,
*Operations Research*23 (1975), 283–298.MATHMathSciNetCrossRefGoogle Scholar - [492]J.B. Sidney, Optimal single-machine scheduling with earliness and tardiness penalties,
*Operations Research*25 (1977), 62–69.MATHMathSciNetCrossRefGoogle Scholar - [493]B.B. Simons, A fast algorithm for single processor scheduling,
*Proceedings of the 19th IEEE Symposium on Foundations of Computer Science*(1978), 246–252.Google Scholar - [494]S.P. Smith, An experiment on using genetic algorithms to learn scheduling heuristics,
*Proceedings of the SPIE-Conference on Applications of Artificial Intelligence X: Knowledge-Based Systems*, SPIE—The International Society for Optical Engineering, Bellingham, WA, Volume 1707, 1992, 378–386Google Scholar - [495]W.E. Smith, Various optimizers for single-stage production,
*Naval Research Logistics Quarterly*3 (1956), 59–66.MathSciNetCrossRefGoogle Scholar - [496]Y.N. Sotskov, The complexity of shop-scheduling problems with two or three jobs,
*European Journal of Operational Research*53 (1991), 326–336.MATHCrossRefGoogle Scholar - [497]Y.N. Sotskov and N.V. Shaklevich, NP-hardness of shop-scheduling problems with three jobs,
*Discrete Applied Mathematics*59 (1995), 237–266.MATHMathSciNetCrossRefGoogle Scholar - [498]Y.N. Sotskov, T. Tautenhahn and F. Werner, Heuristics for permutation flow shop scheduling with batch setup times,
*OR Spektrum*18 (1996), 67–80.MATHCrossRefGoogle Scholar - [499]J.P. Sousa and L.A. Wolsey, A time indexed formulation of non-preemptive singe machine scheduling problems,
*Mathematical Programming*54 (1992), 353–367.MATHMathSciNetCrossRefGoogle Scholar - [500]C. Stein and J. Wein, On the existence of schedules that are near-optimal for both makespan and total weighted completion time,
*Operations Research Letters*21 (1997), 115–122.MATHMathSciNetCrossRefGoogle Scholar - [501]A. Steinberg, A strip-packing algorithm with absolute performance bound two,
*SIAM Journal on Computing*26 (1997), 401–409.MATHMathSciNetCrossRefGoogle Scholar - [502]G. Steiner, Minimizing the number of tardy jobs with precedence constraints and agreeable due dates.
*Discrete Applied Mathematics*72 (1997), 167–177.MATHMathSciNetCrossRefGoogle Scholar - [503]E. Steinitz, Bedingt konvergente Reihen und konvexe Systeme,
*Journal für Reine und Angewandte Mathematik*143 (1913), 128–175.MATHCrossRefGoogle Scholar - [504]J.P. Stinson, E.W. Davis and B.M. Khumawala, Multiple resource-constrained scheduling using branch-and-bound,
*AIIE Transactions*10 (1978), 252–259.Google Scholar - [505]R.H. Storer, S.D. Wu and R. Vaccari, New search spaces for sequencing problems with application to job shop scheduling,
*Management Science*38 (1992), 1495–1509.MATHCrossRefGoogle Scholar - [506]L. Stougie, Personal communication (1995), cited in [547].Google Scholar
- [507]V.A. Strusevich, The two-machine super-shop scheduling problem,
*Journal of the Operational Research Society*42 (1991), 479–492.MATHGoogle Scholar - [508]V.A. Strusevich, Shop scheduling problems under precedence constraints,
*Annals of Operations Research*69 (1997), 351–377.MATHMathSciNetCrossRefGoogle Scholar - [509]W. Szwarc, Elimination methods in the m x n sequencing problem,
*Naval Research Logistics Quarterly*18 (1971), 295–305.MATHMathSciNetCrossRefGoogle Scholar - [510]W. Szwarc, Optimal elimination methods in the m x n sequencing problem,
*Operations Research*21 (1973), 1250–1259.MATHMathSciNetCrossRefGoogle Scholar - [511]W. Szwarc, Dominance conditions for the three-machine flow-shop problem
*Operations Research*26 (1978), 203–206.MATHMathSciNetCrossRefGoogle Scholar - [512]W. Szwarc, Single-machine scheduling to minimize absolute deviation of completion times from a common due date,
*Naval Research Logistics*36 (1989), 663–673.MATHMathSciNetCrossRefGoogle Scholar - [513]W. Szwarc, Parametric precedence relations in single machine scheduling,
*Operations Research Letters*9 (1990), 133–140.MATHMathSciNetCrossRefGoogle Scholar - [514]W. Szwarc, Single machine total tardiness problem revisited, in Y. Ijiri (ed.)
*Creative and Innovative Approaches to the Science of Management*, Quorum Books, 1993, 407–417.Google Scholar - [515]W. Szwarc, Adjacent orderings in single-machine scheduling with earliness and tardiness penalties,
*Naval Research Logistics*40 (1993), 229–243.MATHMathSciNetCrossRefGoogle Scholar - [516]W. Szwarc and S.K. Mukhopadhyay, Minimizing a quadratic cost function of waiting times in single-machine scheduling,
*Journal of the Operational Research Society*46 (1995), 753–761.MATHGoogle Scholar - [517]W. Szwarc and S.K. Mukhopadhyay, Decomposition of the single-machine total tardiness problem,
*Operations Research Letters*19 (1996), 243–250.MATHMathSciNetCrossRefGoogle Scholar - [518]W. Szwarc, M.E. Posner and J.J. Liu, The single machine problem with a quadratic cost function of completion times,
*Management*Science3488 1480–1488.Google Scholar - [519]R. Tadei, J.N.D. Gupta, F. Della Croce and M Cortesi Minimizing makespan in the two-machine flow-shop with release times,
*Journal of the Operational Research Society*49 (1998), 77–85.MATHGoogle Scholar - [520]E. Taillard, Some efficient heuristic methods for the flow shop sequencing problem,
*European Journal of Operational Research*47 (1990), 65–74.MATHMathSciNetCrossRefGoogle Scholar - [521]E Taillard, Benchmarks for basic scheduling problems.
*European Journal of Operational Research*64 (1993), 278–285.MATHCrossRefGoogle Scholar - [522]E. Taillard, Parallel taboo search techniques for the job shop scheduling problem,
*ORSA Journal on Computing*6 (1994), 108–117.MATHGoogle Scholar - [523]F.B. Talbot and J.H. Patterson, An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems.
*Management Science*24 (1978), 1163–1174.MATHCrossRefGoogle Scholar - [524]V.S. Tanaev, V.S. Gordon and Y.M. Shafransky,
*Scheduling Theory: Single-Stage System*, Kluwer Academic Publishers, Dordrecht, 1994.CrossRefGoogle Scholar - [525]V.S. Tanaev, Y.N. Sotskov and V.A. Strusevich,
*Scheduling Theory: Multi-Stage Systems*, Kluwer Academic Publishers, Dordrecht, 1994.MATHCrossRefGoogle Scholar - [526]B.C. Tansel and I. Sabuncuoglu, New insights on the single machine total tardiness problem,
*Journal of the Operational Research Society*48 (1997), 82–89.MATHGoogle Scholar - [527]W. Townsend, Minimizing the maximum penalty in the two-machine flow shop,
*Management Science*24 (1977), 230–234.MATHCrossRefGoogle Scholar - [528]W. Townsend, The single machine problem with quadratic penalty function of completion times: A branch-and-bound solution,
*Management Science*24 (1978), 530–534.MATHCrossRefGoogle Scholar - [529]A.V. Tuzikov, A bi-criteria scheduling problems subject to variation of processing times,
*Zhurnal Vychistlitel’noj Matematiki i Matematicheskoj Fiziki*24 (1984), 1585–1590.MATHMathSciNetGoogle Scholar - [530]J.D. Ullman, NP-Complete scheduling problems,
*Journal of Computing and System Sciences*10 (1975), 384–393.MATHMathSciNetCrossRefGoogle Scholar - [531]J.D. Ullman, Complexity of sequencing problems, in E.G. Coffman, Jr., (ed.)
*Computer and Job-Shop Scheduling Theory*, Wiley, New York, 1976, 139–164.Google Scholar - [532]R.J.M. Vaessens, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by local search,
*INFORMS Journal on Computing*8 (1996), 302–317.MATHCrossRefGoogle Scholar - [533]J.M. van den Akker, LP-Based Solution Methods for Single-Machine Scheduling Problems,
*Ph.D. thesis*, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 1994.MATHGoogle Scholar - [534]J.M. van den Akker, J.A. Hoogeveen and S.L. van de Velde, Parallel machine scheduling by column generation, Report COSOR 95–35, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 1995.Google Scholar
- [535]J.M. van den Akker, J.A. Hoogeveen and S.L. van de Velde, A column generation algorithm for common due date scheduling, Report, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 1998.Google Scholar
- [536]S.L. van de Velde, Minimizing the sum of job completion times in the two-machine flow shop by Lagrangian relaxation,
*Annals of Operations Research*26 (1990), 257–268.MATHMathSciNetGoogle Scholar - [537]S.L. van de Velde, Duality-based algorithms for scheduling unrelated parallel machines,
*ORSA Journal on Computing*5 (1993), 192–205.MATHMathSciNetGoogle Scholar - [538]S.L. van de Velde, Duality decomposition of a single-machine scheduling problem.
*Mathematical Programming*69 (1995), 413–428.MATHMathSciNetCrossRefGoogle Scholar - [539]P.J.M. van Laarhoven, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by simulated annealing,
*Operations Research*40 (1992), 113–125.MATHMathSciNetCrossRefGoogle Scholar - [540]L.N. Van Wassenhove and K.R. Baker, A bicriterion approach to time/cost tradeoffs in sequencing,
*European Journal of Operational Research*11 (1982), 48–54.MATHMathSciNetCrossRefGoogle Scholar - [541]L.N. Van Wassenhove and L.F. Gelders, Solving a bicriterion scheduling problem,
*European Journal of Operational Research*4 (1980), 42–48.MathSciNetCrossRefGoogle Scholar - [542]T.A. Varvarigou, V.P. Roychowdhury, T. Kailath and E.L. Lawler, Scheduling in and out forests in the presence of communication delays,
*IEEE Transactions on Parallel and Distributed Systems**7*(1996), 1065–1074.CrossRefGoogle Scholar - [543]B. Veltman, Multiprocessor scheduling with communication delays,
*Ph.D. thesis*, CWI, Amsterdam, The Netherlands, 1993.Google Scholar - [544]B. Veltman, B.J. Lageweg and J.K. Lenstra, Multiprocessor scheduling with communication delays,
*Parallel Computing*16 (1990), 173–182.MATHCrossRefGoogle Scholar - [545]J.A. Ventura and M.X. Weng, Minimizing single-machine completion time variance
*Management Science*41 (1995), 1448–1455.MATHCrossRefGoogle Scholar - [546]S. Verma and M. Dessouky Single-machine scheduling of unit-time jobs with earliness and tardiness penalties,
*Mathematics of Operations Research*to appear.Google Scholar - [547]A.P.A. Vestjens, On-Line Machine Scheduling,
*Ph.D. thesis*, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 1997.Google Scholar - [548]R.G. Vickson, Two single machine sequencing problems involving controllable job processing times,
*AIIE Transactions*12 (1980), 258–262.MathSciNetGoogle Scholar - [549]R.G. Vickson, Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine,
*Operations Research*28 (1980), 1155–1167.MATHMathSciNetCrossRefGoogle Scholar - [550]F.J. Villarreal and R.L. Bulfin, Scheduling a single machine to minimize the weighted number of tardy jobs,
*IIE Transactions*15 (1983), 337–343.CrossRefGoogle Scholar - [551]S.T. Webster, New bounds for the identical parallel processor weighted flow time problem,
*Management Science*38 (1992), 124–136.MATHCrossRefGoogle Scholar - [552]S.T. Webster, Weighted flow time bounds for scheduling identical processors,
*European Journal of Operational Research*80 (1995), 103–111.MATHCrossRefGoogle Scholar - [553]S.T. Webster, The complexity of scheduling job families about a common due date,
*Operations Research Letters*20 (1997), 65–74.MATHMathSciNetCrossRefGoogle Scholar - [554]S.T. Webster and K.R. Baker, Scheduling groups of jobs on a single machine,
*Operations Research*43 (1995), 692–703.MATHMathSciNetCrossRefGoogle Scholar - [555]M.X. Weng and J.A. Ventura, Scheduling about a large common due date with tolerance to minimize absolute deviation in completion times,
*Naval Research Logistics*41 (1994), 843–851.MATHCrossRefGoogle Scholar - [556]F. Werner, On the heuristic solution of the permutation flow shop problem by path algorithms,
*Computers and Operations Research*20 (1993), 707–722.MATHCrossRefGoogle Scholar - [557]M. Widmer and A. Hertz, A new heuristic method for the flow shop sequencing problem,
*European Journal of Operational Research*41 (1989), 186–193.MATHCrossRefGoogle Scholar - [558]L.J. Wilkerson and J.D. Irwin, An improved method for scheduling independent tasks,
*AIIE Transactions*3 (1971), 239–245.Google Scholar - [559]D.P. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevastianov and D.B. Shmoys, Short shop schedules,
*Operations Research*45 (1997), 288–294.MATHMathSciNetCrossRefGoogle Scholar - [560]D.A. Wismer, Solution of the flow shop scheduling problem with no intermediate queues,
*Operations Research*20 (1972), 689–697.MATHCrossRefGoogle Scholar - [561]G.J. Woeginger, An approximation scheme for minimizing agreeably weighted variance on a single machine, Technical Report Woe-21, Department of Mathematics, TU Graz, Graz, Austria, 1998.Google Scholar
- [562]G.J. Woeginger, When does a dynamic programming formulation guarantee the existence of an FPTAS?, Technical Report Woe-27, Department of Mathematics, TU Graz, Graz, Austria, 1998.Google Scholar
- [563]D.L. Woodruff and M.L. Spearman, Sequencing and batching for two classes of jobs with deadlines and setup times,
*Production and Operations Management*1 (1992), 87–102.CrossRefGoogle Scholar - [564]T. Yamada and R. Nakano, A genetic algorithm applicable to large-scale job-shop problems, in R. Manner and B. Manderick (eds.)
*Parallel Problem Solving from Nature, Vol.2*, Elsevier, Amsterdam, 1992, 281–290.Google Scholar - [565]T. Yamada, B.E. Rosen and R. Nakano, A simulated annealing approach to job shop scheduling using critical block transition operators, Presented at IEEE World Congress of Computational Intelligence, Orlando, FL, USA, 1994.Google Scholar
- [566]C.A. Yano and Y.-D. Kim, Algorithms for a class of single-machine weighted tardiness and earliness problems,
*European Journal of Operational Research*52 (1991), 167–178.MATHCrossRefGoogle Scholar - [567]W. Yu, An approximation algorithm for the total tardiness problem (in Chinese),
*Journal of East China University of Science 6 Technology*18 (1992), 671–677.Google Scholar - [568]W. Yu, Augmentations of consistent partial orders for the one-machine total tardiness problem,
*Discrete Applied Mathematics*68 (1996), 189–202.MATHMathSciNetCrossRefGoogle Scholar - [569]W. Yu and Z. Liu, The performance ratio of the time forward algorithm for the total tardiness problem (in Chinese),
*Chinese Transaction of Operations Research**1*(1997), 89–96.MathSciNetGoogle Scholar - [570]W. Yu and M. Yu, Key position method for total tardiness problem
*(in*Chinese),*Chinese Journal of Operations Research*14 (1995), 11–17.Google Scholar - [571]M. Yue, On the exact upper bound for the multifit processor scheduling algorithms,
*Annals of Operations Research*24 (1990), 233–259.MATHMathSciNetCrossRefGoogle Scholar - [572]S. Zdrzalka, Scheduling jobs on a single machine with release dates, delivery times, and controllable processing times: worst-case analysis,
*Operations Research Letters*10 (1991), 519--532.MATHMathSciNetCrossRefGoogle Scholar - [573]S. Zdrzalka, Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times,
*European Journal of Operational Research*80 (1995), 371–380.CrossRefGoogle Scholar - [574]S. Zdrzalka and J. Grabowski, An algorithm for single machine sequencing with release dates to minimize maximum cost,
*Discrete Applied Mathematics*23 (1989), 73–89.MATHMathSciNetCrossRefGoogle Scholar