scientific article

zbMath0301.90025MaRDI QIDQ4055377

Alexander H. G. Rinnooy Kan, Peter Brucker, Jan Karel Lenstra

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times, The two-machine flow shop problem with arbitrary precedence relations, A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling, Improved heuristics for the early/tardy scheduling problem with no idle time, Makespan minimization for two parallel machines with an availability constraint, A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation, Scheduling shops to minimize the weighted number of late jobs, Approximate Deadline-Scheduling with Precedence Constraints, \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems, A survey of scheduling with controllable processing times, Lot sizing in a no-wait flow shop, An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates, A multi-objective optimization for preemptive identical parallel machines scheduling problem, Scatter search for minimizing weighted tardiness in a single machine scheduling with setups, Decorous combinatorial lower bounds for row layout problems, Single machine unbounded parallel-batch scheduling with forbidden intervals, Genetic algorithms to minimize the weighted number of late jobs on a single machine., Unnamed Item, An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time., A note on scheduling multiprocessor tasks with identical processing times., Scheduling unrelated parallel machines to minimize total weighted tardiness., Minimizing the weighted number of tardy jobs on a two-machine flow shop., Local search for multiprocessor scheduling: how many moves does it take to a local optimum?, On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times., The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine, Open shop scheduling problems with late work criteria., A note on the maximum number of on-time jobs on parallel identical machines., Complexity of mixed shop scheduling problems: A survey, Minimizing functions of infeasibilities in a two-machine flow shop, A note on the SPT heuristic for solving scheduling problems with generalized due dates, Complexity of Project Scheduling Problem with Nonrenewable Resources, Pareto optima for total weighted completion time and maximum lateness on a single machine, Multi-family scheduling in a two-machine reentrant flow shop with setups, Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups, Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources, Scheduling with target start times, On-line scheduling on a single machine: Maximizing the number of early jobs, Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem, A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates, Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates, Stochastic scheduling to minimize expected maximum lateness, Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates, Scheduling unrelated parallel machines with optional machines and jobs selection, The complexity of machine scheduling for stability with a single disrupted job, A review of exact solution methods for the non-preemptive multiprocessor flowshop problem, A flexible flowshop problem with total flow time minimization, Single machine scheduling to minimize total weighted tardiness, Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints, Single machine scheduling with release times, deadlines and tardiness objectives, Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem, Makespan minimization for flow-shop problems with transportation times and a single robot, Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates, An exact approach to early/tardy scheduling with release dates, Minimizing tardiness in a two-machine flow-shop, Algorithms for minclique scheduling problems, Decentralized utilitarian mechanisms for scheduling games, Deterministic job-shop scheduling: Past, present and future, Analysis of the twisting department at superior cable corporation: A case study, Preemptive scheduling on identical parallel machines subject to deadlines., A class of on-line scheduling algorithms to minimize total completion time, Using short-term memory to minimize the weighted number of late jobs on a single machine., Parallel machine scheduling with a common server, Scheduling equal-length jobs on identical parallel machines, Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness, Fast neighborhood search for the single machine total weighted tardiness problem, Nonpreemptive flowshop scheduling with machine dominance, Common due date assignment and scheduling with ready times, Makespan estimation in batch process industries: A comparison between regression analysis and neural networks, A branch and bound to minimize the number of late jobs on a single machine with release time constraints, A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints, An asymptotically exact polynomial algorithm for equipartition problems, A branch and bound algorithm for the job-shop scheduling problem, A compact labelling scheme for series-parallel graphs, An ordered independence system and its applications to scheduling problems, Average and worst-case analysis of heuristics for the maximum tardiness problem, Preemptive scheduling with release dates, delivery times and sequence independent setup times, A block approach for single-machine scheduling with release dates and due dates, Online integrated production-distribution scheduling problems without preemption, Adjustment of heads and tails for the job-shop problem, Development of a heuristic project scheduler under resource constraints, A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties, Complexity of scheduling multiprocessor tasks with prespecified processors allocations, Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications, Minimizing the weighted number of tardy jobs on a single machine with release dates, A tabu search algorithm for the single machine total weighted tardiness problem, A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times, Minimization of the maximal lateness for a single machine, Single machine scheduling to minimize weighted earliness subject to no tardy jobs, Scheduling on parallel identical machines to minimize total tardiness, Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling, Solving the job-shop scheduling problem optimally by dynamic programming, An investigation on a two-agent single-machine scheduling problem with unequal release dates, An analysis of the non-preemptive mixed-criticality match-up scheduling problem, Improving schedule stability in single-machine rescheduling for new operation insertion, Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics, Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time, A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date, Bi-criteria single machine scheduling with a time-dependent learning effect and release times, On optimizing a bi-objective flowshop scheduling problem in an uncertain environment, The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan, A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\), A new integer programming formulation for the permutation flowshop problem, An algorithm for single machine sequencing with release dates to minimize maximum cost, A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop, Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling, `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders, A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry, Scheduling unrelated parallel machines with sequence-dependent setups, Multiple and bicriteria scheduling: A literature survey, A procedure for the one-machine sequencing problem with dependent jobs, Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times, Scheduling problems with partially ordered jobs, On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification, Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems, Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates, Heuristic procedures for minimizing makespan and the number of required pallets, Is a unit-job shop not easier than identical parallel machines?, EA/G-GA for single machine scheduling problems with earliness/tardiness costs, An adaptive branching rule for the permutation flow-shop problem, Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times, Complexity results for scheduling chains on a single machine, Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs, A survey of results for sequencing problems with controllable processing times, The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem, Production scheduling with alternative process plans, An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective, Single-machine scheduling with past-sequence-dependent delivery times and release times, A state-of-the-art review of parallel-machine scheduling research, An algorithm for single machine sequencing with deadlines to minimize total weighted completion time, On the complexity of generalized due date scheduling problems, Single machine scheduling problem with a common deadline and resource dependent release dates, The complexity of shop-scheduling problems with two or three jobs, A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times, A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates, Minimizing the number of late jobs for the permutation flowshop problem with secondary resources, Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis, A study of scheduling problems with preemptions on multi-core computers with GPU accelerators, A note on the total completion time problem in a permutation flowshop with a learning effect, Scheduling with release dates on a single machine to minimize total weighted completion time, A scheduling problem with job values given as a power function of their completion times, Single-machine scheduling under the job rejection constraint, Integrated production and distribution scheduling with committed delivery dates, Bounding strategies for the hybrid flow shop scheduling problem, On-line scheduling to minimize average completion time revisited., A simulated annealing approach to minimize the maximum lateness on uniform parallel machines, Single machine scheduling problems with financial resource constraints: some complexity results and properties, Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times, A parallel multiple reference point approach for multi-objective optimization, Scheduling tasks with exponential duration on unrelated parallel machines, Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop, Iterated greedy local search methods for unrelated parallel machine scheduling, A population-based variable neighborhood search for the single machine total weighted tardiness problem, Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates, Interval-indexed formulation based heuristics for single machine total weighted tardiness problem, Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility, Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect, Single machine parallel-batch scheduling with deteriorating jobs, A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem, The connection between the bump number problem and flow-shop scheduling with precedence constraints, A note on a single machine scheduling problem with generalized total tardiness objective function, Single machine earliness and tardiness scheduling, The single-machine total tardiness scheduling problem: review and extensions, Models for concurrent product and process design, Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case, Complexity of single machine, multi-criteria scheduling problems, An approximation algorithm for a single-machine scheduling problem with release times and delivery times, A note on generalizing the maximum lateness criterion for scheduling, Mathematical programming formulations for machine scheduling: A survey, An optimal scheduling algorithm for preemptable real-time tasks