scientific article; zbMATH DE number 1302193
From MaRDI portal
Publication:4247460
zbMath0944.90022MaRDI QIDQ4247460
Gerhard J. Woeginger, Chris N. Potts, Bo Chen
Publication date: 26 September 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Approximation algorithms (68W25)
Related Items
On-line service scheduling, Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop, A survey of scheduling with controllable processing times, An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times, Scheduling under linear constraints, General scheduling non-approximability results in presence of hierarchical communications, Necessary and sufficient conditions of optimality for some classical scheduling problems, A tabu search algorithm for the single machine total weighted tardiness problem, A study on several combination problems of classic shop scheduling and shortest path, Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time, Models and complexity of multibin packing problems, Online and semi-online scheduling of two machines under a grade of service provision, Bicriteria approximation algorithms for scheduling problems with communications delays, On the complexity of adjacent resource scheduling, An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness, Scheduling problems with partially ordered jobs, An FPTAS for scheduling with resource constraints, Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs, A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops, Partial solutions and multifit algorithm for multiprocessor scheduling, A note on posterior tight worst-case bounds for longest processing time schedules, Fast approximation algorithms for job scheduling with processing set restrictions, An iterative algorithm for scheduling UET tasks with due dates and release times., Optimal results and numerical simulations for flow shop scheduling problems, An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts, A note on a two-agent scheduling problem related to the total weighted late work, An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications., On minimizing dataset transfer time in an acyclic network with four servers, On the complexity of scheduling problems with a fixed number of parallel identical machines, Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility, Scheduling uniform machines with restricted assignment, A global constraint for total weighted completion time for unary resources, An approximation algorithm for scheduling two parallel machines with capacity constraints., Scheduling jobs with equal processing times subject to machine eligibility constraints, Scheduling on same-speed processors with at most one downtime on each machine, Single machine scheduling with controllable release and processing parameters, Scheduling parallel machines with inclusive processing set restrictions, A complete 4-parametric complexity classification of short shop scheduling problems, Online scheduling of bounded length jobs to maximize throughput, Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs, Scheduling cleaning activities on trains by minimizing idle times, A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization, On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems., Parallel machine scheduling of machine-dependent jobs with unit-length., Minimizing the makespan in nonpreemptive parallel machine scheduling problem, Metaheuristics for order scheduling problem with unequal ready times, Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration, Complexity, bounds and dynamic programming algorithms for single track train scheduling, Complexity and approximation for precedence constrained scheduling problems with large communication delays, Three-index linear programs with nested structure, Performance of service policies in a specialized service system with parallel servers, Robust surgery loading, Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs, Two-machine open shop problem with controllable processing times, Multi-index transportation problems with 1-nested structure, Scheduling on uniform processors with at most one downtime on each machine, Scheduling with time-of-use costs, Combination of parallel machine scheduling and vertex cover, An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times, On-line scheduling of small open shops, Scheduling tasks on a flexible manufacturing machine to minimize tool change delays, On the single machine total tardiness problem, Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem, Stochastic scheduling on parallel machines to minimize discounted holding costs, Parallel machine scheduling with job assignment restrictions, On preemption redundancy in scheduling unit processing time jobs on two parallel machines, The routing open-shop problem on a network: complexity and approximation, Scheduling advertisements on a web page to maximize revenue, Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work, Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem, Parameterized complexity of a coupled-task scheduling problem, Scheduling jobs with release and delivery times subject to nested eligibility constraints, A new heuristic and an exact approach for a production planning problem, Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs, A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage, Complete Complexity Classification of Short Shop Scheduling, An empirical analysis of the optimality rate of flow shop heuristics, Parallel machine batching and scheduling with deadlines, Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness, Minimizing the number of machines for minimum length schedules, A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups, Scheduling parallel machines with inclusive processing set restrictions and job release times, Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs, Flowshop scheduling research after five decades, A review of TSP based approaches for flowshop scheduling, Single-machine scheduling problems with precedence constraints and simple linear deterioration, A PTAS for the average weighted completion time problem on unrelated machines., An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications, A survey of the state-of-the-art of common due date assignment and scheduling research, Heuristics for hybrid flow shops with controllable processing times and assignable due dates, On-line scheduling to minimize Max flow time: an optimal preemptive algorithm, On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications, Semi-on-line problems on two identical machines with combined partial information, Two-machine flowshop scheduling with a secondary criterion
Uses Software
