Publication:4124328
From MaRDI portal
zbMath0353.68067MaRDI QIDQ4124328
Peter Brucker, Alexander H. G. Rinnooy Kan, Jan Karel Lenstra
Publication date: 1977
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
90B35: Deterministic scheduling theory in operations research
68W99: Algorithms in computer science
Related Items
Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine, A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times, A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates., Performance of the LPT algorithm in multiprocessor scheduling, Single machine scheduling with nonlinear lateness cost functions and fuzzy due dates, Crane scheduling in container yards with inter-crane interference, Effective optimization methods for single-machine scheduling (survey), New directions in scheduling theory, Algorithms for two-machine flow-shop sequencing with precedence constraints, Linear programming models for load balancing, The coordination of scheduling and batch deliveries, New single machine and job-shop scheduling problems with availability constraints, Pre-emptive scheduling problems with controllable processing times, On the continuous working problem, A controlled search simulated annealing method for the single machine weighted tardiness problem, Approximation results in parallel machines stochastic scheduling, Reducibility among single machine weighted completion time scheduling problems, Some no-wait shops scheduling problems: Complexity aspect, On a scheduling problem where a job can be executed only by a limited number of processors, The two-machine flowshop scheduling problem with total tardiness, Scheduling algorithms based on necessary optimality conditions, Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty, A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile, General approximation algorithms for some arithmetical combinatorial problems, An algorithm for single machine sequencing with release dates to minimize total weighted completion time, Surrogate duality relaxation for job shop scheduling, A time indexed formulation of non-preemptive single machine scheduling problems, Task scheduling with interprocessor communication delays, A review of open queueing network models of manufacturing systems, A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops, The job shop scheduling problem: Conventional and new solution techniques, Approximability of flow shop scheduling, Minimizing average completion time in the presence of release dates, An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups, Scheduling two jobs with fixed and nonfixed routes, A look-ahead heuristic for scheduling jobs with release dates on a single machine, Scheduling parallel machines to minimize total weighted and unweighted tardiness, On the complexity of two machine job-shop scheduling with regular objective functions, Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing, Decomposition methods for large job shops, A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size, No-wait or no-idle permutation flowshop scheduling with dominating machines, A computational study of the permutation flow shop problem based on a tight lower bound, Core instances for testing: a case study, Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds, Lower bounds for the job-shop scheduling problem on multi-purpose machines, Some concepts of stability analysis in combinatorial optimization, Scheduling unit processing time jobs on a single machine with multiple criteria, Structural scheduling in the problems of scheduling theory, Using genetic algorithms for single-machine bicriteria scheduling problems, Approximation schemes for parallel machine scheduling problems with controllable processing times, NP-hardness of shop-scheduling problems with three jobs, An efficient algorithm for a job shop problem, Minimizing the sum of weighted completion times with unrestricted weights, Asymptotic optimality of statistical multiplexing in pipelined processing, On a scheduling problem in a robotized analytical system, A sequencing problem with family setup times, Scheduling with limited machine availability, Single machine scheduling with nonlinear cost functions, Approximation algorithms for minimizing the total weighted tardiness on a single machine, Parallel machine selection and job scheduling to minimize machine cost and job tardiness, Approximation algorithms for scheduling problems with a modified total weighted tardiness objective, Yard crane scheduling in port container terminals, The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates, A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time, Two very large-scale neighborhoods for single machine scheduling, Scheduling in supply chain environment, Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals, Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs, Analysis of a linearization heuristic for single-machine scheduling to maximize profit, Scheduling of a single machine to minimize total weighted completion time subject to release dates, Unnamed Item
