scientific article; zbMATH DE number 3550182

zbMATH Open0353.68067MaRDI QIDQ4124328FDOQ4124328

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

Publication date: 1977

Title of this publication is not available (Why is that?)

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Algorithms in computer science (68W99)

Cited In (only showing first 100 items - show all)

A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
Online production planning to maximize the number of on-time orders
Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
An efficient ILP formulation for the single machine scheduling problem
On a scheduling problem where a job can be executed only by a limited number of processors
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
Metaheuristics for order scheduling problem with unequal ready times
A controlled search simulated annealing method for the single machine weighted tardiness problem
A sequencing problem with family setup times
Parameterized complexity of machine scheduling: 15 open problems
Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
Scheduling algorithms based on necessary optimality conditions
Structural scheduling in the problems of scheduling theory
General approximation algorithms for some arithmetical combinatorial problems
An efficient algorithm for a job shop problem
Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
A metric approach for scheduling problems with minimizing the maximum penalty
A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
Optimizing termination decision for meta-heuristic search techniques that converge to a static objective-value distribution
Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
Two-machine interval shop scheduling with time lags
A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines
Optimal control of a two-server flow-shop network
Loading and scheduling for flexible manufacturing systems with controllable processing times
Single machine scheduling with nonlinear cost functions
Modeling single machine preemptive scheduling problems for computational efficiency
Approximation results in parallel machines stochastic scheduling
Mathematical model applied to single-track line scheduling problem in Brazilian railways
Analysis of a linearization heuristic for single-machine scheduling to maximize profit
Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups
On a scheduling problem in a robotized analytical system
Scheduling and fixed-parameter tractability
Min-max relative regret for scheduling to minimize maximum lateness
Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms
Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
On the continuous working problem
A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
Reducibility among single machine weighted completion time scheduling problems
Effective optimization methods for single-machine scheduling (survey)
New directions in scheduling theory
Task scheduling with interprocessor communication delays
Algorithms for two-machine flow-shop sequencing with precedence constraints
The Vehicle Routing Problem with Release and Due Dates
Linear programming models for load balancing
Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine
Minimizing the weighted number of tardy jobs on multiple machines: a review
Scheduling equal length jobs with eligibility restrictions
On some lower bounds for the permutation flowshop problem
Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
A note on reverse scheduling with maximum lateness objective
Single machine batch scheduling with release times and delivery costs
An artificial bee colony algorithm for the job shop scheduling problem with random processing times
Minimizing value-at-risk in single-machine scheduling
Bounding the running time of algorithms for scheduling and packing problems
A new approximation algorithm for unrelated parallel machine scheduling with release dates
A hybrid differential evolution and tree search algorithm for the job shop scheduling problem
A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm
Optimal results and numerical simulations for flow shop scheduling problems
Parallel machine selection and job scheduling to minimize machine cost and job tardiness
On the complexity of scheduling problems with a fixed number of parallel identical machines
Single machine scheduling with nonlinear lateness cost functions and fuzzy due dates
Yard crane scheduling in port container terminals
Minimizing average completion time in the presence of release dates
Two very large-scale neighborhoods for single machine scheduling
Using genetic algorithms for single-machine bicriteria scheduling problems
Scheduling bidirectional traffic on a path
New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
Analysis of the similarities and differences of job-based scheduling problems
Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem
Performance of the LPT algorithm in multiprocessor scheduling
From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
Minimizing the stretch when scheduling flows of divisible requests
Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm
Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires
Notes on inverse bin-packing problems
The one-machine just-in-time scheduling problem with preemption
A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm
Preemptive scheduling of equal-length jobs in polynomial time
Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
Instance space analysis and algorithm selection for the job shop scheduling problem
Finding optimal tour schedules on transportation paths under extended time window constraints
Bicriteria scheduling problem for unrelated parallel machines with release dates
Acquisition planning and scheduling of computing resources
A study on several combination problems of classic shop scheduling and shortest path
A survey of single machine scheduling to minimize weighted number of tardy jobs
Matching based very large-scale neighborhoods for parallel machine scheduling
Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times
Robust scheduling with budgeted uncertainty
Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
Constraint programming approach to a bilevel scheduling problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124328)