scientific article

Alexander H. G. Rinnooy Kan, Jan Karel Lenstra, Eugene L. Lawler

Publication date: 1982

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

bibliography single machine scheduling parallel machine scheduling open shop, flow shop and job shop scheduling optimization and approximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

Efficient scheduling algorithms for a single batch processing machine, Feasibility of scheduling lot sizes of two frequencies on one machine, Nonclairvoyant scheduling, An improved shifting bottleneck procedure for the job shop scheduling problem, A block approach for single-machine scheduling with release dates and due dates, On the complexity of preemptive openshop scheduling problems, Scheduling tasks on two processors with deadlines and additional resources, Benchmarks for basic scheduling problems, On some complexity properties of N-free posets and posets with bounded decomposition diameter, ``PLATE: A decision support system for resource constrained scheduling problems, A network flow algorithm for just-in-time project scheduling, Development of a heuristic project scheduler under resource constraints, A decision support system for the resource constrained project scheduling problem, A decomposition approach in a DSS for a resource constrained scheduling problem, A genetic algorithm for the job shop problem, Evolution based learning in a job shop scheduling environment, Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs, Optimal match-up strategies in stochastic scheduling, Stochastic scheduling and forwards induction, A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows, Scheduling with semaphore constraints, Scheduling independent tasks with multiple modes, Multiprocessor scheduling with interprocessor communication delays, S3 sets. An extension of the Beale-Tomlin special ordered sets, High-level synthesis: Current status and future prospects, Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms, On a scheduling problem where a job can be executed only by a limited number of processors, Approximating total flow time on parallel machines, A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots, New trends in machine scheduling, Strategies for LP-based solving a general class of scheduling problems, An exact algorithm for parallel machine scheduling with conflicts, Real-time scheduling of an automated manufacturing center, Time complexity of single machine scheduling with stochastic precedence constraints, Ordinal algorithms for parallel machine scheduling, General stochastic single-machine scheduling with regular cost functions, Resource-constrained job scheduling with recyclable resources, Minimizing late jobs in the general one machine scheduling problem, A procedure for the one-machine sequencing problem with dependent jobs, Improving the preemptive bound for the single machine dynamic maximum lateness problem, A survey on offline scheduling with rejection, Scheduling on uniform machines with a conflict graph: complexity and resolution, Scheduling of project networks, Minimizing mean flow time with release time constraint, Job oriented production scheduling, A state-of-the-art review of parallel-machine scheduling research, An appraisal of computational complexity for operations researchers, An Extensive Tabu Search Algorithm for Solving the Lot Streaming Problem in a Job Shop Environment, Permutation vs. non-permutation flow shop schedules, Some new results in flow shop scheduling, A time indexed formulation of non-preemptive single machine scheduling problems, Proactive release procedures for just-in-time job shop environments, subject to machine failures, A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling, Scheduling linearly shortening jobs under precedence constraints, Solving job shop scheduling problems utilizing the properties of backbone and ``big valley, Optimal and heuristic solutions for a scheduling problem arising in a foundry, Scheduling identical jobs on uniform machines with a conflict graph, Network flow approaches to pre-emptive open-shop scheduling problems with time-windows, Scheduling algorithms for flexible flowshops: Worst and average case performance, Performance of the LPT algorithm in multiprocessor scheduling, Structure of a simple scheduling polyhedron, Deterministic job-shop scheduling: Past, present and future, Two branch and bound algorithms for the permutation flow shop problem, The job shop scheduling problem: Conventional and new solution techniques, Scheduling jobs on parallel machines with sequence-dependent setup times, Sevast'yanov's algorithm for the flow-shop scheduling problem, Single machine scheduling with batch deliveries, An innovative four-layer heuristic for scheduling multi-mode projects under multiple resource constrains, Scheduling in network flow shops, A fully polynomial approximation scheme for the total tardiness problem, Unnamed Item, Scheduling in robotic cells: Complexity and steady state analysis, New directions in scheduling theory, A review of TSP based approaches for flowshop scheduling, A variant of time minimizing assignment problem, Flowshop scheduling with identical jobs and uniform parallel machines, The complexity of scheduling jobs in repetitive manufacturing systems, Performance of scheduling algorithms for no-wait flowshops with parallel machines, An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns, A polynomial algorithm for a multi-item capacitated production planning problem, An algorithm for minimizing setups in precedence constrained scheduling, Open shops with jobs overlap, A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}\) open shop problem], Mathematical programming formulations for machine scheduling: A survey, Two parallel machines problem with job delivery coordination and availability constraint