A state-of-the-art review of parallel-machine scheduling research
From MaRDI portal
Publication:919994
DOI10.1016/0377-2217(90)90215-WzbMath0707.90053MaRDI QIDQ919994
Cheng, T. C. Edwin, C. C. S. Sin
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
A PC-based production scheduling system using a mixed integer programming approach, A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS, Scheduling manufacturing systems for delayed product differentiation in agile manufacturing, Scheduling of unrelated parallel manufacturing cells with limited human resources, An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines, Scheduling experiments on a nulear reactor using mixed integer programming, Mass customization in videotape duplication and conversion: challenges of flexible duplication systems, fast delivery, and electronic service, Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory, Scheduling unrelated parallel machines with sequence-dependent setups, Scheduling problems in master-slave model, Optimal and heuristic solution methods for a multiprocessor machine scheduling problem, Minimizing the number of tardy jobs for \(m\) parallel machines, Minimizing the schedule length for a parallel 3D-grid precedence graph, Heuristics for unrelated machine scheduling with precedence constraints, Scheduling under a common due-date on parallel unrelated machines, Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines, Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions, A variant of time minimizing assignment problem, Flowshop scheduling with identical jobs and uniform parallel machines, Parallel machine scheduling to minimize costs for earliness and number of tardy jobs, Optimal multiprocessor task scheduling using dominance and equivalence relations, A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective, A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations, Minimizing makespan in hybrid flowshops, BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem, Approximate algorithms for the \(P\parallel C_{\max}\) problem, Scheduling jobs within time windows on identical parallel machines: New model and algorithms, Parallel machine scheduling of machine-dependent jobs with unit-length., Parallel machine scheduling with splitting jobs, A survey of the state-of-the-art of common due date assignment and scheduling research, A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem, A cutting plane algorithm for the unrelated parallel machine scheduling problem, A lexi-search algorithm for a time minimizing assignment problem., Minimization of makespan in generalized assignment problem., Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company, Assembly line balancing and group working: a heuristic procedure for workers' groups operating on the same product and workstation, A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups, A study of integer programming formulations for scheduling problems, Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment, Unnamed Item, Analysis of partial setup strategies for solving the operational planning problem in parallel machine electronic assembly systems, Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time, Product grouping for batch processes
Cites Work
- New directions in scheduling theory
- On the NP-completeness of the n/m/parallel/\(\sum_{i\leq i\leq m}\{\sum w_ j\sum t_ j\}\) scheduling problem
- Probabilistic bounds for dual bin-packing
- The rate of convergence to optimality of the LPT rule
- New trends in machine scheduling
- Solving a bicriterion scheduling problem
- A bicriterion approach to time/cost trade-offs in sequencing
- NP-complete scheduling problems
- Optimal scheduling for two-processor systems
- Scheduling with Deadlines and Loss Functions
- A linear time approximation algorithm for multiprocessor scheduling
- Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
- A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
- Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling
- Hu's precedence tree scheduling algorithm: A simple proof
- Scheduling Independent Tasks on Uniform Processors
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
- Bounds for Multifit Scheduling on Uniform Processors
- On the Expected Relative Performance of List Scheduling
- The Asymptotic Optimality of the LPT Rule
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
- Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
- Preemptive Scheduling with Due Dates
- A New Algorithm for Preemptive Scheduling of Trees
- Bounds on Schedules for Independent Tasks with Similar Execution Times
- Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems
- Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors
- On Scheduling Independent Tasks with Restricted Execution Times
- Linear-Time Algorithms for Scheduling on Parallel Processors
- An Almost-Linear Algorithm for Two-Processor Scheduling
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Efficiency of a Good But Not Linear Set Union Algorithm
- On the Computational Complexity of Combinatorial Problems
- Algorithms for Scheduling Independent Tasks
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- On Two—Processor Scheduling of One— or Two—Unit Time Tasks with Precedence Constraints
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- A Level Algorithm for Preemptive Scheduling
- On general routing problems
- A Survey of Scheduling Rules
- A parallel sequencing algorithm for minimizing total cost
- An Application of Bin-Packing to Multiprocessor Scheduling
- Worst Case Analysis of Two Scheduling Algorithms
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
- On the Complexity of Mean Flow Time Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Some simple scheduling algorithms
- Scheduling Opposing Forests
- Scheduling independent tasks to reduce mean finishing time
- An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem
- Scheduling with parallel processors and linear delay costs
- Scheduling with Deadlines and Loss Functions on k Parallel Machines
- Bounds for Certain Multiprocessing Anomalies
- Optimal Preemptive Scheduling on Two-Processor Systems
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Bounds on Multiprocessing Timing Anomalies
- Optimal Sequencing of Two Equivalent Processors
- Erratum “Optimal Sequencing of Two Equivalent Processors”
- The complexity of theorem-proving procedures
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
