scientific article; zbMATH DE number 1167865

Publication date: 18 June 1998

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

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

Related Items

Effective on-line algorithms for reliable due date quotation and large-scale scheduling ⋮ Parallel machine scheduling models with fuzzy processing times ⋮ An efficient approximation for the generalized assignment problem ⋮ Maximizing the throughput of parallel jobs on hypercubes ⋮ Memory management optimization problems for integrated circuit simulators ⋮ Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date ⋮ Scheduling equal processing time jobs to minimize the weighted number of late jobs ⋮ Optimal scheduling of a two-stage hybrid flow shop ⋮ Solving the job-shop scheduling problem optimally by dynamic programming ⋮ Solving a concrete sleepers production scheduling by genetic algorithms ⋮ Online scheduling with interval conflicts ⋮ Two machine scheduling under disruptions with transportation considerations ⋮ A note on the two machine job shop with the weighted late work criterion ⋮ Multiindex optimal production planning problems ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ On maximizing the throughput of multiprocessor tasks. ⋮ Hybrid flow-shop scheduling problems with multiprocessor task systems. ⋮ The complexity of two-job shop problems with multi-purpose unrelated machines. ⋮ Single machine scheduling to minimize the number of late jobs under uncertainty. ⋮ Open shop scheduling problems with late work criteria. ⋮ Data transfer planning with tree placement for collaborative environments ⋮ Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters. ⋮ Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion ⋮ An analysis of totally clairvoyant scheduling ⋮ Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility ⋮ A polynomial time algorithm for Zero-Clairvoyant scheduling ⋮ Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm ⋮ Scheduling partially ordered jobs faster than \(2^n\) ⋮ Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems ⋮ Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints ⋮ Bounding strategies for the hybrid flow shop scheduling problem ⋮ Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion ⋮ Scheduling with tails and deadlines ⋮ Designing PTASs for MIN-SUM scheduling problems ⋮ Scheduling in a contaminated area: a model and polynomial algorithms ⋮ A possibilistic approach to sequencing problems with fuzzy parameters ⋮ A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem ⋮ The two-machine flow-shop problem with weighted late work criterion and common due date ⋮ On preemption redundancy in scheduling unit processing time jobs on two parallel machines ⋮ Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints ⋮ Maximizing project cash availability ⋮ Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems ⋮ Planning production using mathematical programming: The case of a woodturning company ⋮ Preemptive scheduling on identical parallel machines subject to deadlines. ⋮ Probabilistic analysis of shelf algorithms for strip packing ⋮ Approximate algorithms to pack rectangles into several strips ⋮ A note on the single machine scheduling to minimize the number of tardy jobs with deadlines ⋮ On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls ⋮ Flowshop scheduling research after five decades ⋮ A review of TSP based approaches for flowshop scheduling ⋮ PERT scheduling with convex cost functions. ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research ⋮ On two single machine scheduling problems with fuzzy processing times and fuzzy due dates