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 (only showing first 100 items - show all)

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 ⋮ A PTAS for minimizing weighted flow time on a single machine ⋮ Minimizing tardiness in a two-machine flow-shop ⋮ Algorithms for minclique scheduling problems ⋮ The non-stop disjoint trajectories problem ⋮ 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

This page was built for publication: