scientific article; zbMATH DE number 3550182
From MaRDI portal
Publication:4124328
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)
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Speed scaling for maximum lateness
- Integrated production and distribution scheduling problems related with fixed delivery departure dates and number of late orders
- Single machine total tardiness maximization problems: complexity and algorithms
- Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
- Complexity of single machine scheduling subject to nonnegative inventory constraints
- A graph coloring approach to the deployment scheduling and unit assignment problem
- Total completion time minimization on multiple machines subject to machine availability and makespan constraints
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- Scheduling of a single machine to minimize total weighted completion time subject to release dates
- The coordination of scheduling and batch deliveries
- A time indexed formulation of non-preemptive single machine scheduling problems
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines
- Title not available (Why is that?)
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
- A decomposition scheme for single stage scheduling problems
- A new hybrid genetic algorithm for job shop scheduling problem
- Integrated scheduling of production and distribution with release dates and capacitated deliveries
- Scheduling two jobs with fixed and nonfixed routes
- Exact algorithms for single-machine scheduling with time windows and precedence constraints
- Solving the traveling repairman problem on a line with general processing times and deadlines
- Effective on-line algorithms for reliable due date quotation and large-scale scheduling
- Optimal due date assignment in multi-machine scheduling environments
- A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- New single machine and job-shop scheduling problems with availability constraints
- Scheduling jobs that arrive over time
- Scheduling unit processing time jobs on a single machine with multiple criteria
- Optimal solutions for a dock assignment problem with trailer transportation
- Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- Preemption in single machine earliness/tardiness scheduling
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
- An assignment-based lower bound for a class of two-machine flow shop problems
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- Some concepts of stability analysis in combinatorial optimization
- Resource constraint scheduling with a fractional shared resource
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- NP-hardness of shop-scheduling problems with three jobs
- A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
- Stochastic Online Scheduling Revisited
- Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
- Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
- Scheduling with limited machine availability
- Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
- A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis
- A two-machine flowshop problem with two agents
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- Parallel machine problems with equal processing times: a survey
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- Surrogate duality relaxation for job shop scheduling
- A computational study of the permutation flow shop problem based on a tight lower bound
- A review of open queueing network models of manufacturing systems
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- Decomposition methods for large job shops
- The job shop scheduling problem: Conventional and new solution techniques
- Crane scheduling in container yards with inter-crane interference
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- Some no-wait shops scheduling problems: Complexity aspect
- A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.
- A complete 4-parametric complexity classification of short shop scheduling problems
- A linear programming-based method for job shop scheduling
- Reoptimization in machine scheduling
- Pre-emptive scheduling problems with controllable processing times
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
- An empirical analysis of the optimality rate of flow shop heuristics
- The two-machine flowshop scheduling problem with total tardiness
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- Approximability of flow shop scheduling
- A look-ahead heuristic for scheduling jobs with release dates on a single machine
- Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity
- An exact approach for scheduling jobs with regular step cost functions on a single machine
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
- Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction
- Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
- An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
- Lower bounds for the job-shop scheduling problem on multi-purpose machines
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- 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
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)