Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
From MaRDI portal
Publication:965714
DOI10.1016/j.apm.2008.05.019zbMath1205.90129OpenAlexW2035264266MaRDI QIDQ965714
Publication date: 24 April 2010
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2008.05.019
Related Items (16)
Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines ⋮ An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem ⋮ Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ An exact extended formulation for the unrelated parallel machine total weighted completion time problem ⋮ A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness ⋮ GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times ⋮ Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines ⋮ Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration ⋮ Distributionally robust scheduling on parallel machines under moment uncertainty ⋮ A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity ⋮ The crop growth planning problem in vertical farming ⋮ Preface: Project management and scheduling ⋮ A new approximation algorithm for unrelated parallel machine scheduling with release dates ⋮ Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Mathematical programming formulations for machine scheduling: A survey
- Optimal preemptive semi-online scheduling on two uniform processors
- Tabu search algorithms for cyclic machine scheduling problems
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Preemptive scheduling to minimize mean weighted flow time
- A state-of-the-art review of parallel-machine scheduling research
- Weighted flow time bounds for scheduling identical processors
- Scheduling with release dates on a single machine to minimize total weighted completion time
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- Minimizing average completion time in the presence of release dates
- Early/tardy scheduling with sequence dependent setups on uniform parallel machines
- Scheduling identical parallel machines to minimize total weighted completion time
- An approximation algorithm for the generalized assignment problem
- Applying tabu search with influential diversification to multiprocessor scheduling
- Current trends in deterministic scheduling
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- A concise survey of scheduling with time-dependent processing times
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
- Scheduling on uniform parallel machines to minimize maximum lateness
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Structure of a simple scheduling polyhedron
- On the minimization of total weighted flow time with identical and uniform parallel machines
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- Parallel local search
- A comment on scheduling on uniform machines under chain-type precedence constraints
- Scheduling with Deadlines and Loss Functions
- Single Machine Scheduling with Release Dates
- Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
- Approximation in stochastic scheduling
- Convex quadratic and semidefinite programming relaxations in scheduling
- Minimizing Total Tardiness on One Machine is NP-Hard
- Sequencing with Earliness and Tardiness Penalties: A Review
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
- New Bounds for the Identical Parallel Processor Weighted Flow Time Problem
- Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
- Complexity of Scheduling under Precedence Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Task Scheduling in Networks
- Solving Parallel Machine Scheduling Problems by Column Generation
- A supermodular relaxation for scheduling with release dates
- Scheduling independent tasks to reduce mean finishing time
- Scheduling Unrelated Machines by Randomized Rounding
- The m-Traveling Salesman Problem with Minmax Objective
- Scheduling with parallel processors and linear delay costs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
This page was built for publication: Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
