Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714): Difference between revisions

Latest revision as of 19:09, 2 July 2024

scientific article

Language	Label	Description	Also known as
English	Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms	scientific article

Statements

instance of

scholarly article

0 references

title

Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (English)

0 references

0 references

0 references

Applied Mathematical Modelling

0 references

publication date

24 April 2010

0 references

zbMATH Keywords

parallel-machine scheduling

0 references

total weighted completion time

0 references

model

0 references

relaxation

0 references

algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.apm.2008.05.019

0 references

cites work

Current trends in deterministic scheduling

0 references

A state-of-the-art review of parallel-machine scheduling research

0 references

Q4546261

0 references

Sequencing with Earliness and Tardiness Penalties: A Review

0 references

A survey of the state-of-the-art of common due date assignment and scheduling research

0 references

A concise survey of scheduling with time-dependent processing times

0 references

Scheduling with Deadlines and Loss Functions

0 references

Technical Note—Minimizing Average Flow Time with Parallel Machines

0 references

Scheduling independent tasks to reduce mean finishing time

0 references

Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops

0 references

Minimizing average completion time in the presence of release dates

0 references

Scheduling with parallel processors and linear delay costs

0 references

An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime

0 references

New Bounds for the Identical Parallel Processor Weighted Flow Time Problem

0 references

Scheduling identical parallel machines to minimize total weighted completion time

0 references

On the minimization of total weighted flow time with identical and uniform parallel machines

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines

0 references

Mathematical programming formulations for machine scheduling: A survey

0 references

Convex quadratic and semidefinite programming relaxations in scheduling

0 references

Approximation algorithms for scheduling unrelated parallel machines

0 references

Solving Parallel Machine Scheduling Problems by Column Generation

0 references

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

0 references

Formulating the single machine sequencing problem with release dates as a mixed integer program

0 references

Scheduling with release dates on a single machine to minimize total weighted completion time

0 references

Structure of a simple scheduling polyhedron

0 references

A supermodular relaxation for scheduling with release dates

0 references

Single Machine Scheduling with Release Dates

0 references

Q4250213

0 references

Approximation in stochastic scheduling

0 references

Q3873927

0 references

Q3320129

0 references

Q2723565

0 references

A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times

0 references

A Functional Equation and its Application to Resource Allocation and Sequencing Problems

0 references

A new dynamic programming algorithm for the parallel machines total weighted completion time problem

0 references

Task Scheduling in Networks

0 references

An approximation algorithm for the generalized assignment problem

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Q3840371

0 references

Parallel local search

0 references

Tabu search algorithms for cyclic machine scheduling problems

0 references

Applying tabu search with influential diversification to multiprocessor scheduling

0 references

The m-Traveling Salesman Problem with Minmax Objective

0 references

A comment on scheduling on uniform machines under chain-type precedence constraints

0 references

Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios

0 references

Optimal preemptive semi-online scheduling on two uniform processors

0 references

Scheduling on uniform parallel machines to minimize maximum lateness

0 references

Early/tardy scheduling with sequence dependent setups on uniform parallel machines

0 references

Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.

0 references

An alternative framework to Lagrangian relaxation approach for job shop scheduling.

0 references

A branch and bound to minimize the number of late jobs on a single machine with release time constraints

0 references

Weighted flow time bounds for scheduling identical processors

0 references

Q4844985

0 references

Complexity of Scheduling under Precedence Constraints

0 references

Q3217922

0 references

Minimizing Total Tardiness on One Machine is NP-Hard

0 references

Preemptive scheduling to minimize mean weighted flow time

0 references

Q4537758

0 references

Q4875178

0 references

Identifiers

zbMATH Open document ID

1205.90129

0 references

DOI

10.1016/j.apm.2008.05.019

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:965714

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.apm.2008.05.019
+Normal rank
@@ Property / OpenAlex ID @@
+W2035264266
@@ Property / OpenAlex ID: W2035264266 / rank @@
+Normal rank
@@ Property / cites work @@
+Current trends in deterministic scheduling
@@ Property / cites work: Current trends in deterministic scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+A state-of-the-art review of parallel-machine scheduling research
+Normal rank
@@ Property / cites work @@
+Q4546261
@@ Property / cites work: Q4546261 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequencing with Earliness and Tardiness Penalties: A Review
+Normal rank
@@ Property / cites work @@
+A survey of the state-of-the-art of common due date assignment and scheduling research
+Normal rank
@@ Property / cites work @@
+A concise survey of scheduling with time-dependent processing times
+Normal rank
@@ Property / cites work @@
+Scheduling with Deadlines and Loss Functions
@@ Property / cites work: Scheduling with Deadlines and Loss Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—Minimizing Average Flow Time with Parallel Machines
+Normal rank
@@ Property / cites work @@
+Scheduling independent tasks to reduce mean finishing time
+Normal rank
@@ Property / cites work @@
+Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
+Normal rank
@@ Property / cites work @@
+Minimizing average completion time in the presence of release dates
+Normal rank
@@ Property / cites work @@
+Scheduling with parallel processors and linear delay costs
+Normal rank
@@ Property / cites work @@
+An improved branching scheme for the branch and bound procedure of scheduling<i>n</i>jobs on<i>m</i>parallel machines to minimize total weighted flowtime
+Normal rank
@@ Property / cites work @@
+New Bounds for the Identical Parallel Processor Weighted Flow Time Problem
+Normal rank
@@ Property / cites work @@
+Scheduling identical parallel machines to minimize total weighted completion time
+Normal rank
@@ Property / cites work @@
+On the minimization of total weighted flow time with identical and uniform parallel machines
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
+Normal rank
@@ Property / cites work @@
+Mathematical programming formulations for machine scheduling: A survey
+Normal rank
@@ Property / cites work @@
+Convex quadratic and semidefinite programming relaxations in scheduling
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Solving Parallel Machine Scheduling Problems by Column Generation
+Normal rank
@@ Property / cites work @@
+Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
+Normal rank
@@ Property / cites work @@
+Formulating the single machine sequencing problem with release dates as a mixed integer program
+Normal rank
@@ Property / cites work @@
+Scheduling with release dates on a single machine to minimize total weighted completion time
+Normal rank
@@ Property / cites work @@
+Structure of a simple scheduling polyhedron
@@ Property / cites work: Structure of a simple scheduling polyhedron / rank @@
+Normal rank
@@ Property / cites work @@
+A supermodular relaxation for scheduling with release dates
+Normal rank
@@ Property / cites work @@
+Single Machine Scheduling with Release Dates
@@ Property / cites work: Single Machine Scheduling with Release Dates / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250213
@@ Property / cites work: Q4250213 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation in stochastic scheduling
@@ Property / cites work: Approximation in stochastic scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Q3873927
@@ Property / cites work: Q3873927 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3320129
@@ Property / cites work: Q3320129 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2723565
@@ Property / cites work: Q2723565 / rank @@
+Normal rank
@@ Property / cites work @@
+A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times
+Normal rank
@@ Property / cites work @@
+A Functional Equation and its Application to Resource Allocation and Sequencing Problems
+Normal rank
@@ Property / cites work @@
+A new dynamic programming algorithm for the parallel machines total weighted completion time problem
+Normal rank
@@ Property / cites work @@
+Task Scheduling in Networks
@@ Property / cites work: Task Scheduling in Networks / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+Scheduling Unrelated Machines by Randomized Rounding
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Q3840371
@@ Property / cites work: Q3840371 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel local search
@@ Property / cites work: Parallel local search / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu search algorithms for cyclic machine scheduling problems
+Normal rank
@@ Property / cites work @@
+Applying tabu search with influential diversification to multiprocessor scheduling
+Normal rank
@@ Property / cites work @@
+The <i>m</i>-Traveling Salesman Problem with Minmax Objective
+Normal rank
@@ Property / cites work @@
+A comment on scheduling on uniform machines under chain-type precedence constraints
+Normal rank
@@ Property / cites work @@
+Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
+Normal rank
@@ Property / cites work @@
+Optimal preemptive semi-online scheduling on two uniform processors
+Normal rank
@@ Property / cites work @@
+Scheduling on uniform parallel machines to minimize maximum lateness
+Normal rank
@@ Property / cites work @@
+Early/tardy scheduling with sequence dependent setups on uniform parallel machines
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
+Normal rank
@@ Property / cites work @@
+An alternative framework to Lagrangian relaxation approach for job shop scheduling.
+Normal rank
@@ Property / cites work @@
+A branch and bound to minimize the number of late jobs on a single machine with release time constraints
+Normal rank
@@ Property / cites work @@
+Weighted flow time bounds for scheduling identical processors
+Normal rank
@@ Property / cites work @@
+Q4844985
@@ Property / cites work: Q4844985 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling under Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Q3217922
@@ Property / cites work: Q3217922 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Total Tardiness on One Machine is NP-Hard
+Normal rank
@@ Property / cites work @@
+Preemptive scheduling to minimize mean weighted flow time
+Normal rank
@@ Property / cites work @@
+Q4537758
@@ Property / cites work: Q4537758 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4875178
@@ Property / cites work: Q4875178 / rank @@
+Normal rank