scientific article; zbMATH DE number 830382

Publication date: 7 January 1996

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

computational complexity parallel machines single machine batching due dates shop scheduling classification of scheduling problems

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items (49)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Timetabling of sorting slots in a logistic warehouse ⋮ Scheduling two-machine preemptive open shops to minimize total completion time ⋮ Capacitated Arc Stabbing ⋮ The three-machine proportionate open shop and mixed shop minimum makespan problems ⋮ Inverse chromatic number problems in interval and permutation graphs ⋮ A capacity-oriented hierarchical approach to single-item and small-batch production planning using project-scheduling methods ⋮ On the complexity of two machine job-shop scheduling with regular objective functions ⋮ Look ahead job demanding for improving job shop performance ⋮ Shortest common superstrings and scheduling with coordinated starting times ⋮ Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem ⋮ A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring ⋮ On minimizing the weighted number of late jobs in unit execution time open-shops. ⋮ Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. ⋮ Time-of-use scheduling problem with equal-length jobs ⋮ Strong polynomiality of resource constraint propagation ⋮ Dominance rules in combinatorial optimization problems ⋮ Resource-constrained project scheduling: A survey of recent developments. ⋮ Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates ⋮ Scheduling chained multiprocessor tasks onto large multiprocessor system ⋮ A polynomial algorithm for some preemptive multiprocessor task scheduling problems ⋮ Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks ⋮ Single-machine scheduling with no idle time and release dates to~minimize a regular criterion ⋮ An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. ⋮ Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times ⋮ Complexity of mixed shop scheduling problems: A survey ⋮ Scheduling in a continuous galvanizing line ⋮ Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop ⋮ A note on the paper Resource-constraint project scheduling: Notation, classification, models and methods by Bruckner et al ⋮ Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem ⋮ On Minimizing Total Tardiness in a Serial Batching Problem ⋮ Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines. ⋮ A hybrid framework for over-constrained generalized resource-constrained project scheduling problems ⋮ Scheduling preemptive open shops to minimize total tardiness ⋮ An approach to determine storage locations of containers at seaport terminals ⋮ Two-machine flowshop scheduling with job class setups to minimize total flowtime ⋮ Open block scheduling in optical communication networks ⋮ Preemptive scheduling in the presence of transportation times ⋮ Some new results on simulated annealing applied to the job shop scheduling problem ⋮ A polynomial algorithm for minDSC on a subclass of series Parallel graphs ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Scheduling multiprocessor tasks -- An overview ⋮ Lot sizing and scheduling -- survey and extensions ⋮ Metric interpolation for the problem of minimizing the maximum lateness for a single machine ⋮ Scheduling equal-length jobs on identical parallel machines ⋮ A branch and bound algorithm for the resource-constrained project scheduling problem ⋮ The disjunctive graph machine representation of the job shop scheduling problem ⋮ Improved dynamic programs for some batching problems involving the maximum lateness criterion ⋮ On scheduling cycle shops: Classification, complexity and approximation

This page was built for publication: