scientific article

Publication date: 1983

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

survey NP-completeness parallel machine flow shop open shop precedence constraints preemptive scheduling polynomial-time algorithms single-machine sequencing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (41)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ A better lower bound for on-line scheduling ⋮ An ordered independence system and its applications to scheduling problems ⋮ Necessary and sufficient conditions of optimality for some classical scheduling problems ⋮ New trends in machine scheduling ⋮ An examination of job interchange relationships and induction-based proofs in single machine scheduling ⋮ On a scheduling problem in a robotized analytical system ⋮ Augmentations of consistent partial orders for the one-machine total tardiness problem ⋮ Online Throughput Maximization on Unrelated Machines: Commitment is No Burden ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors ⋮ Minimizing total tardiness on parallel machines with preemptions ⋮ The generalized assignment problem: Valid inequalities and facets ⋮ Preemptive scheduling of two uniform parallel machines to minimize total tardiness ⋮ Minimizing mean flow time with release time constraint ⋮ Almost nonpreemptive schedules ⋮ On the complexity of generalized due date scheduling problems ⋮ Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines ⋮ Production scheduling problems in a textile industry ⋮ Processor bounding for an efficient non-preemptive task scheduling algorithm ⋮ A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ Parameterized complexity of machine scheduling: 15 open problems ⋮ A unified view of parallel machine scheduling with interdependent processing rates ⋮ On single machine scheduling with resource constraint ⋮ Shop scheduling problems with pliable jobs ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Preemptive scheduling on uniform machines to minimize mean flow time ⋮ Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs ⋮ Scheduling independent two processor tasks on a uniform duo-processor system ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Parallel machine scheduling with splitting jobs ⋮ Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines ⋮ New directions in scheduling theory ⋮ A review of TSP based approaches for flowshop scheduling ⋮ The complexity of scheduling jobs in repetitive manufacturing systems ⋮ Linear programming models for load balancing ⋮ Open shops with jobs overlap ⋮ Mathematical programming formulations for machine scheduling: A survey ⋮ Minimizing the number of late jobs on unrelated machines ⋮ New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria

This page was built for publication: