Single machine scheduling research

[1]  V. Srinivasan.  A hybrid algorithm for the one machine sequencing problem to minimize total tardiness , 1971 .

[2]  L. G. Mitten,et al.  Sequencing Operations to Minimize In-Process Inventory Costs , 1965 .

[3]  Pedro G. Gazmuri.  Probabilistic Analysis of a Machine Scheduling Problem , 1985, Math. Oper. Res..

[4]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[5]  Linus Schrage,et al.  Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks , 1978, Oper. Res..

[6]  D. P. Bovet,et al.  Evaluation of scheduling algorithms for resources with high set-up time , 1980 .

[7]  S. Miyazaki.  ONE MACHINE SCHEDULING PROBLEM WITH DUAL CRITERIA , 1981 .

[8]  Rod M. Burstall,et al.  A Heuristic Method for a Job-Scheduling Problem , 1966 .

[9]  Michael H. Rothkopf,et al.  Scheduling Independent Tasks on Parallel Processors , 1966 .

[10]  Albert Schild,et al.  On Scheduling Tasks with Associated Linear Loss Functions , 1961 .

[11]  Tadashi Kurisu.  SINGLE-MACHINE SEQUENCING WITH PRECEDENCE CONSTRAINTS AND DEFERRAL COSTS , 1979 .

[12]  M. L. Wolfson,et al.  An Algorithm for Solving Job Sequencing Problems , 1967 .

[13]  Pierre N. Robillard,et al.  Scheduling with earliest start and due date constraints , 1971 .

[14]  Samuel Eilon,et al.  Industrial Scheduling Abstracts (1950‐1966) , 1968 .

[15]  Gabriel R. Bitran,et al.  Hierarchical Production Planning: A Single Stage System , 1981, Oper. Res..

[16]  Salah E. Elmaghraby,et al.  Optimal project compression with due‐dated events , 1979 .

[17]  Jeffrey B. Sidney,et al.  Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties , 1977, Oper. Res..

[18]  T. Ibaraki,et al.  A polynomial time algorithm for a chance-constrained single machine scheduling problem , 1983 .

[19]  R. Larson,et al.  Symmetry and optimally properties of the single machine problem , 1978 .

[20]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[21]  Samuel Eilon,et al.  Minimising Waiting Time Variance in the Single Machine Problem , 1977 .

[22]  Milan Vlach.  One - processor scheduling with nonuniform ready times 1 , 1979 .

[23]  Kenneth R. Baker,et al.  Sequencing independent jobs with a single resource , 1980 .

[24]  Sushil K. Gupta,et al.  Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure , 1984 .

[25]  Jatinder N. D. Gupta,et al.  Optimal schedules for single facility with two job classes , 1984, Comput. Oper. Res..

[26]  H. Mine,et al.  PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES , 1979 .

[27]  W. A. Horn.  Some simple scheduling algorithms , 1974 .

[28]  Raymond G. Vickson,et al.  Two Single Machine Sequencing Problems Involving Controllable Job Processing Times , 1980 .

[29]  L. B. J. M. Sturm.  A Simple Optimality Proof of Moore's Sequencing Algorithm , 1970 .

[30]  Werner Dinkelbach,et al.  Note---A Note on Shwimer's Theorem A , 1977 .

[31]  S. Eilon.  Scheduling for batch production , 1957 .

[32]  Dennis J. Sweeney,et al.  Using multidimensional scaling to solve traveling salesman and machine scheduling problems , 1980, Comput. Oper. Res..

[33]  Arnoldo C. Hax,et al.  Hierarchical integration of production planning and scheduling , 1973 .

[34]  Michael H. Rothkopf.  Scheduling with Random Service Times , 1966 .

[35]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[36]  W. Townsend.  The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution , 1978 .

[37]  R. Burns.  Scheduling to minimize the weighted sum of completion times with secondary criteria , 1976 .

[38]  Oscar H. Ibarra,et al.  Approximation Algorithms for Certain Scheduling Problems , 1978, Math. Oper. Res..

[39]  Lucio Bianco,et al.  Scheduling of a single machine to minimize total weighted completion time subject to release dates , 1982 .

[40]  Michael Pinedo,et al.  Stochastic Scheduling with Release Dates and Due Dates , 1983, Oper. Res..

[41]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[42]  Kenneth Steiglitz,et al.  A Problem in Single-Machine Sequencing with Nonlinear Delay Costs , 1976 .

[43]  Sen Tapan,et al.  A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem , 1983 .

[44]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[45]  E. L. Lawler,et al.  A fully polynomial approximation scheme for the total tardiness problem , 1982, Oper. Res. Lett..

[46]  Robert L. Bulfin,et al.  Scheduling a Single Machine to Minimize the Weighted Number of Tardy Jobs , 1983 .

[47]  R. E. Larson,et al.  A Forward-Backward Procedure for the Single Machine Problem to Minimize Maximum Lateness , 1980 .

[48]  L. V. Wassenhove,et al.  An algorithm for single machine sequencing with deadlines to minimize total weighted completion time , 1983 .

[49]  J. Carlier.  The one-machine sequencing problem , 1982 .

[50]  Eugene L. Lawler.  On Scheduling Problems with Deferral Costs , 1964 .

[51]  B. D. Sivazlian,et al.  Minimization of Time-Varying Costs in Single-Machine Scheduling , 1978, Oper. Res..

[52]  Ludo Gelders,et al.  Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II - Computation and Structure , 1975, Oper. Res..

[53]  Sushil K. Gupta.  Production scheduling techniques , 1981 .

[54]  B. J. Lageweg,et al.  Minimizing maximum lateness on one machine : Computational experience and some applications , 1976 .

[55]  Jan Karel Lenstra,et al.  Recent developments in deterministic sequencing and scheduling: a survey : (preprint) , 1981 .

[56]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[57]  Horace W. Heck,et al.  A note on the extension of a result on scheduling with secondary criteria , 1972 .

[58]  Clyde L. Monma,et al.  Sequencing with general precedence constraints , 1981, Discret. Appl. Math..

[59]  Kevin D. Glazebrook,et al.  On non-preemptive strategies for stochastic scheduling problems in continuous time , 1981 .

[60]  T. Morton,et al.  Algoristics for Single-Machine Sequencing with Precedence Constraints , 1978 .

[61]  John E. Moore.  An Algorithm for a Single Machine Scheduling Problem with Sequence Dependent Setup Times and Scheduling Windows , 1975 .

[62]  Mesbah U. Ahmed,et al.  Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling , 1984 .

[63]  R. E. Larson,et al.  Heuristic procedures for the single machine problem to minimize maximum lateness , 1978 .

[64]  J. M. Moore,et al.  A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

[65]  J. Erschler,et al.  Applying new dominance concepts to job schedule optimization , 1982 .

[66]  Graham McMahon,et al.  On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness , 1975, Oper. Res..

[67]  Hiroshi Kise,et al.  Note-On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem , 1983 .

[68]  Donald L. Adolphson,et al.  Single Machine Job Sequencing with Precedence Constraints , 1977, SIAM J. Comput..

[69]  K. Kortanek,et al.  On a New Class of Combinatoric Optimizers for Multi-Product Single-Machine Scheduling , 1969 .

[70]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[71]  B. J. Lageweg,et al.  Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..

[72]  T. C. E. Cheng,et al.  Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine , 1984 .

[73]  Hamilton Emmons,et al.  A note on a scheduling problem with dual criteria , 1975 .

[74]  Clyde L. Monma,et al.  Sequencing to Minimize the Maximum Job Cost , 1980, Oper. Res..

[75]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[76]  J. Erschler,et al.  Characterizing the set of feasible sequences for n jobs to be carried out on a single machine , 1980 .

[77]  John R. King,et al.  Production Scheduling , 1988, Computer-Aided Production Management.

[78]  Salah E. Elmaghraby,et al.  The machine sequencing problem – review and extensions , 1968 .

[79]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[80]  Hamilton Emmons,et al.  Scheduling Production on One Machine with Changeover Costs , 1977 .

[81]  Michael J. Magazine,et al.  Myopic heuristics for single machine scheduling problems , 1981 .

[82]  Eugene L. Lawler,et al.  Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

[83]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[84]  Toshihide Ibaraki,et al.  A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times , 1978, Oper. Res..

[85]  Michael Sipser,et al.  On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals , 1984, Oper. Res..

[86]  W. A. Horn.  Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties , 1972 .

[87]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[88]  Marshall L. Fisher,et al.  Analysis of a linearization heuristic for single-machine scheduling to maximize profit , 1984, Math. Program..

[89]  Eugene L. Lawler,et al.  Preemptive scheduling of uniform machines subject to release dates : (preprint) , 1979 .

[90]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[91]  Maurice Queyranne,et al.  The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..

[92]  L. Schrage.  Minimizing the Time-in-System Variance for a Finite Jobset , 1975 .

[93]  Samuel Eilon,et al.  Multi-product batch production on a single machine--A problem revisited , 1985 .

[94]  S. Lakshminarayan,et al.  Technical Note - Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties , 1978, Oper. Res..

[95]  Raymond Tremolieres.  Scheduling Jobs of Equal Durations with Tardiness Costs and Resource Limitations , 1978 .

[96]  Gabriel R. Bitran,et al.  ON THE DESIGN OF HIERARCHICAL PRODUCTION PLANNING SYSTEMS , 1977 .

[97]  Tapan Sen,et al.  A state-of-art survey of static scheduling research involving due dates , 1984 .

[98]  Stephen C. Graves,et al.  A Review of Production Scheduling , 1981, Oper. Res..

[99]  R. N. Burns,et al.  Single Machine Scheduling with Series-Parallel Precedence Constraints , 1981, Oper. Res..

[100]  H. Emmons.  One machine sequencing to minimize mean flow time with minimum number tardy , 1975 .

[101]  Kenneth R. Baker,et al.  An experimental comparison of solution algorithms for the single‐machine tardiness problem , 1974 .

[102]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[103]  J. J. Kanet.  Minimizing the average deviation of job completion times about a common due date , 1981 .

[104]  C. N. Potts,et al.  Technical Note - Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times , 1980, Oper. Res..

[105]  J. William Gavett,et al.  Three Heuristic Rules for Sequencing Jobs to a Single Production Facility , 1965 .

[106]  Thom J. Hodgson,et al.  Note---A Note on Single Machine Sequencing with Random Processing Times , 1977 .

[107]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[108]  C. N. Potts,et al.  An algorithm for the single machine sequencing problem with precedence constraints , 1980 .

[109]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[110]  Roy D. Shapiro,et al.  Scheduling coupled tasks , 1980 .

[111]  J. Erschler,et al.  A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates , 1983, Oper. Res..

[112]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[113]  S. Bansal.  Single machine scheduling to minimize weighted sum of completion times with secondary criterion -- A branch and bound approach , 1980 .

[114]  K. Glazebrook.  Stochastic scheduling with order constraints , 1976 .

[115]  W. Maxwell.  On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs , 1970 .

[116]  S. Ross,et al.  Scheduling Jobs Subject to Nonhomogeneous Poisson Shocks , 1980 .

[117]  K. R. Baker.  Procedures for sequencing tasks with one resource type , 1973 .

[118]  Jan Karel Lenstra,et al.  Sequencing and scheduling : an annotated bibliography , 1997 .

[119]  B. P. Banerjee,et al.  Single Facility Sequencing with Random Execution Times , 1965 .

[120]  A. G. Lockett,et al.  Technical Note - A Scheduling Problem Involving Sequence Dependent Changeover Times , 1972, Oper. Res..

[121]  R. A. Blau.  N-Job, One Machine Sequencing Problems Under Uncertainty , 1973 .

[122]  N. Nakamura,et al.  Group production scheduling for minimum total tardiness Part(I) , 1978 .

[123]  J. Wesley Barnes,et al.  Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs , 1981, Oper. Res..

[124]  Earl E. Bomberger,et al.  A Dynamic Programming Approach to a Lot Size Scheduling Problem , 1966 .

[125]  John A. Buzacott,et al.  Sequencing many jobs on a multi-purpose facility , 1971 .

[126]  Linus Schrage,et al.  Dynamic Programming Solution of Sequencing Problems with Precedence Constraints , 1978, Oper. Res..

[127]  S. S. Panwalkar,et al.  Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..

[128]  Kenneth R. Baker,et al.  Sequencing with due-dates and early start times to minimize maximum tardiness , 1974 .

[129]  Edward P. C. Kao,et al.  A multiple objective decision theoretic approach to one-machine scheduling problems , 1980, Comput. Oper. Res..

[130]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[131]  M. I. Dessouky,et al.  The One-Machine Sequencing Problem with Early Starts and Due Dates , 1972 .

[132]  K. Glazebrook.  On stochastic scheduling with precedence relations and switching costs , 1980, Journal of Applied Probability.

[133]  A.H.G. Rinnooy Kan,et al.  New directions in scheduling theory , 1984 .

[134]  Ludo Gelders,et al.  Four solution techniques for a general one machine scheduling problem: A comparative study , 1978 .

[135]  H. Weiss.  A Greedy Heuristic for Single Machine Sequencing with Precedence Constraints , 1981 .

[136]  Jan Karel Lenstra,et al.  Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints , 1983, Oper. Res..

[137]  C. Derman,et al.  A Renewal Decision Problem , 1978 .

[138]  P. J. Weeda.  A dynamic programming formulation for the one machine sequencing problem , 1978 .

[139]  L. Gelders,et al.  Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory , 2015, Oper. Res..

[140]  Richard C. Wilson,et al.  Sequence dependent set-up times and job sequencing , 1977 .

[141]  C. Potts.  A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time , 1985 .

[142]  H. Simon,et al.  Optimal Strategies for a Class of Constrained Sequential Problems , 1977 .

[143]  K. Glazebrook.  On the evaluation of fixed permutations as strategies in stochastic scheduling , 1982 .

[144]  Tap An Sen Sushil,et al.  An Improvement for Weiss's Greedy Heuristic , 1983 .

[145]  C. A. Komar,et al.  The Effectiveness of Three Heuristic Rules for Job Sequencing in a Single Production Facility , 1973 .

[146]  S. S. Panwalkar,et al.  Optimal assignment of due-dates for a single processor scheduling problem , 1981 .

[147]  Kevin D. Glazebrook.  On single‐machine sequencing with order constraints , 1980 .

[148]  J. D. Irwin,et al.  An Improved Method for Scheduling Independent Tasks , 1971 .

[149]  Kenneth R. Baker.  Computational Experience with a Sequencing Algorithm Adapted to the Tardiness Problem , 1977 .

[150]  S. Eilon.  Five Approaches to Aggregate Production Planning , 1975 .

[151]  R. G. Vickson,et al.  Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine , 1980, Oper. Res..

[152]  Tapan Sen,et al.  Minimizing the Range of Lateness on a Single Machine , 1984 .

[153]  Marshall L. Fisher,et al.  A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..

[154]  M. Florian,et al.  On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem , 1973 .

[155]  R. R. P. Jackson,et al.  Elements of production planning and control , 1962 .

[156]  George Steiner,et al.  Single Machine Scheduling with Precedence Constraints of Dimension 2 , 1984, Math. Oper. Res..

[157]  Michael Florian,et al.  An Implicit Enumeration Algorithm for the Machine Sequencing Problem , 1971 .

[158]  Jan Karel Lenstra,et al.  Complexity results for scheduling chains on a single machine : (preprint) , 1980 .

[159]  H. Taha.  Sequencing by Implicit Ranking and Zero-One Polynomial Programming , 1971 .

[160]  K. Roscoe Davis,et al.  Addressing the N/1 scheduling problem - A heuristic approach , 1977, Comput. Oper. Res..

[161]  Michael H. Rothkopf,et al.  Technical Note - There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs , 1984, Oper. Res..

[162]  Alan G. Merten,et al.  Variance Minimization in Single Machine Sequencing Problems , 1972 .

[163]  C. R. Glassey,et al.  Minimum Change-Over Scheduling of Several Products on One Machine , 1968, Oper. Res..

[164]  Irwin J. Fredman,et al.  Scheduling Tasks with Deadlines and Non-Linear Loss Functions , 1962 .

[165]  Chris N. Potts,et al.  An algorithm for single machine sequencing with release dates to minimize total weighted completion time , 1983, Discret. Appl. Math..

[166]  K. R. Baker,et al.  A bicriterion approach to time/cost trade-offs in sequencing , 1982 .

[167]  Robert E. Tarjan,et al.  Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines , 1981, SIAM J. Comput..

[168]  H. Kise,et al.  AN EFFICIENT ALGORITHM FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEM , 1982 .

[169]  Gabriel R. Bitran,et al.  Hierarchical Production Planning: A Two-Stage System , 1982, Oper. Res..

[170]  D. Adolphson.  Optimal linear-ordering. , 1973 .

[171]  Ludo Gelders,et al.  Solving a bicriterion scheduling problem , 1980 .

[172]  William L. Maxwell,et al.  Single machine sequencing with random processing times and random due-dates† , 1969 .

[173]  Stephen J. Balut,et al.  Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain , 1973 .

[174]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[175]  Clyde L. Monma,et al.  Sequencing with Series-Parallel Precedence Constraints , 1979, Math. Oper. Res..

[176]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[177]  J. R. Jackson.  SCHEDULING A PRODUCTION LINE TO MINIMIZE MAXIMUM TARDINESS , 1955 .

[178]  S. Eilon.  Economic Batch-Size Determination for Multi-Product Scheduling , 1959 .

[179]  Kevin D. Glazebrook,et al.  On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs , 1981, Oper. Res..

[180]  R. Sielken.  Sequencing with Setup Costs by Zero-One Mixed Integer Linear Programming , 1976 .

[181]  David S. Johnson,et al.  Scheduling Tasks with Nonuniform Deadlines on Two Processors , 1976, J. ACM.

[182]  Sushil K. Gupta,et al.  Minimizing a quadratic function of job lateness on a single machine , 1983 .

[183]  P. C. Bagga,et al.  Note-A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem , 1980 .

[184]  Kevin D. Glazebrook,et al.  On nonpreemptive strategies in stochastic scheduling , 1981 .

[185]  Marc E. Posner,et al.  Minimizing Weighted Completion Times with Deadlines , 1985, Oper. Res..

[186]  John J. Kanet,et al.  Minimizing Variation of Flow Time in Single Machine Systems , 1981 .

[187]  J. George Shanthikumar,et al.  Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number , 1983, Comput. Oper. Res..

[188]  Parviz Ghandforoush,et al.  An Algorithm for the Single-Machine Sequencing Problem to Minimize Total Tardiness , 1983 .