Optimal Sequencing of a Single Machine Subject to Precedence Constraints
From MaRDI portal
Publication:5668250
DOI10.1287/mnsc.19.5.544zbMath0254.90039MaRDI QIDQ5668250
Publication date: 1973
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.19.5.544
90C10: Integer programming
Related Items
Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness, Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times, A branch and bound algorithm for the minimum storage-time sequencing problem, Scheduling deteriorating jobs on a single machine to minimize the maximum processing times, Sequencing jobs on a single machine: A neural network approach, Scheduling with tails and deadlines, Scheduling problems with partially ordered jobs, Minimizing the number of tardy jobs in single machine sequencing, Solving scheduling and location problems in the plane simultaneously, Effective optimization methods for single-machine scheduling (survey), Optimal assignment of slack due-date and sequencing in a single machine shop, Mathematical programming formulations for machine scheduling: A survey, Minimizing the number of late jobs in a stochastic setting using a chance constraint, Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness, A 2-OPT procedure to reduce total inspection time in a serial inspection process, Probabilistic single processor scheduling, A faster algorithm for the maximum weighted tardiness problem, Optimal assignment of slack due-dates and sequencing in a single-machine shop, Complexity of single machine scheduling problems under scenario-based uncertainty, Single-machine scheduling under the job rejection constraint, The counting complexity of a simple scheduling problem, Single machine scheduling with release dates and rejection, Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure, Improved polynomial algorithms for robust bottleneck problems with interval data, An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem, An algorithm for single machine sequencing with release dates to minimize maximum cost, Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty, k-optimal solution sets for some polynomially solvable scheduling problems, Multiple and bicriteria scheduling: A literature survey, Sequencing with general precedence constraints, On the measurement of complexity in activity networks, A bicriterion approach to time/cost trade-offs in sequencing, On the complexity of generalized due date scheduling problems, Applications of a semi-dynamic convex hull algorithm, Four solution techniques for a general one machine scheduling problem. A comparative study, Bicriterion scheduling of identical processing time jobs by uniform processors, Scheduling inverse trees under the communication model of the LogP-machine, A note on generalizing the maximum lateness criterion for scheduling, An optimal scheduling algorithm for preemptable real-time tasks, A possibilistic approach to sequencing problems with fuzzy parameters, Single machine scheduling to minimize total weighted tardiness, On two single machine scheduling problems with fuzzy processing times and fuzzy due dates, Scheduling with fuzzy delays and fuzzy precedences., Single machine group scheduling with ordered criteria, Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time, Minimizing functions of infeasibilities in a two-machine flow shop, Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints, Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times, Multi-agent scheduling on a single machine with max-form criteria, Multi-agent single machine scheduling, Stochastic scheduling to minimize expected maximum lateness, The complexity of machine scheduling for stability with a single disrupted job, Characterizations of polygreedoids and poly-antimatroids by greedy algorithms, Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion, Scheduling in a contaminated area: a model and polynomial algorithms, Scheduling orders for multiple product types with due date related objectives, An algorithmic characterization of antimatroids, SOME GENERAL PROPERTIES OF A FUZZY SINGLE MACHINE SCHEDULING PROBLEM, Unnamed Item, Single Machine General Maximum Cost Problem with Parallel-Chain Precedence Constraints, Time complexity of single machine scheduling with stochastic precedence constraints, Optimal assignment of NOP due-dates and sequencing in a single machine shop
