Publication:4396949
From MaRDI portal
zbMath0914.90157MaRDI QIDQ4396949
Publication date: 18 June 1998
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
90B30: Production models
90C27: Combinatorial optimization
90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming
Related Items
Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility, Maximizing project cash availability, Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems, Probabilistic analysis of shelf algorithms for strip packing, Approximate algorithms to pack rectangles into several strips, Scheduling with tails and deadlines, On preemption redundancy in scheduling unit processing time jobs on two parallel machines, Scheduling equal processing time jobs to minimize the weighted number of late jobs, Optimal scheduling of a two-stage hybrid flow shop, Solving a concrete sleepers production scheduling by genetic algorithms, Two machine scheduling under disruptions with transportation considerations, A note on the two machine job shop with the weighted late work criterion, Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems, A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion, Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm, 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., Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters., A survey of the state-of-the-art of common due date assignment and scheduling research, 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, Preemptive scheduling on identical parallel machines subject to deadlines., PERT scheduling with convex cost functions., On two single machine scheduling problems with fuzzy processing times and fuzzy due dates, Parallel machine scheduling models with fuzzy processing times, 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, An analysis of totally clairvoyant scheduling, A polynomial time algorithm for Zero-Clairvoyant scheduling, Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems, Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion, Designing PTASs for MIN-SUM scheduling problems, Scheduling in a contaminated area: a model and polynomial algorithms, Flowshop scheduling research after five decades, A review of TSP based approaches for flowshop scheduling
