Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135): Difference between revisions

Revision as of 09:42, 23 May 2024

scientific article

Language	Label	Description	Also known as
English	Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem	scientific article

Statements

instance of

scholarly article

0 references

title

Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (English)

0 references

0 references

0 references

Annals of Operations Research

0 references

publication date

1 December 1994

0 references

zbMATH Keywords

Lagrangian relaxation

0 references

unrelated machine scheduling

0 references

total weighted flow time

0 references

time-window job availability

0 references

machine downtime

0 references

branch-and-cut

0 references

Lagrangian dual formulation

0 references

lower and upper bounds

0 references

branch-and-bound

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q4133397

0 references

A Multiplier Adjustment Approach for the Set Partitioning Problem

0 references

The Lagrangian Relaxation Method for Solving Integer Programming Problems

0 references

Two-Processor Scheduling with Start-Times and Deadlines

0 references

Q4198056

0 references

The generalized assignment problem: Valid inequalities and facets

0 references

(1,k)-configuration facets for the generalized assignment problem

0 references

A block approach for single-machine scheduling with release dates and due dates

0 references

Facet of regular 0–1 polytopes

0 references

Validation of subgradient optimization

0 references

On scheduling with ready-times, due-dates and vacations

0 references

An Algorithm for Large Set Partitioning Problems

0 references

Q4040221

0 references

On the facial structure of set packing polyhedra

0 references

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

0 references

Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times

0 references

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

0 references

A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems

0 references

Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines

0 references

A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs

0 references

A time indexed formulation of non-preemptive single machine scheduling problems

0 references

Easily Computable Facets of the Knapsack Polytope

0 references

Identifiers

zbMATH Open document ID

0812.90067

0 references

DOI

10.1007/BF02085647

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1339135

@@ Property / cites work @@
+Q4133397
@@ Property / cites work: Q4133397 / rank @@
+Normal rank
@@ Property / cites work @@
+A Multiplier Adjustment Approach for the Set Partitioning Problem
+Normal rank
@@ Property / cites work @@
+The Lagrangian Relaxation Method for Solving Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+Two-Processor Scheduling with Start-Times and Deadlines
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The generalized assignment problem: Valid inequalities and facets
+Normal rank
@@ Property / cites work @@
+(1,k)-configuration facets for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+A block approach for single-machine scheduling with release dates and due dates
+Normal rank
@@ Property / cites work @@
+Facet of regular 0–1 polytopes
@@ Property / cites work: Facet of regular 0–1 polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Validation of subgradient optimization
@@ Property / cites work: Validation of subgradient optimization / rank @@
+Normal rank
@@ Property / cites work @@
+On scheduling with ready-times, due-dates and vacations
+Normal rank
@@ Property / cites work @@
+An Algorithm for Large Set Partitioning Problems
@@ Property / cites work: An Algorithm for Large Set Partitioning Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+On the facial structure of set packing polyhedra
@@ Property / cites work: On the facial structure of set packing polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
+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 @@
+A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
+Normal rank
@@ Property / cites work @@
+Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
+Normal rank
@@ Property / cites work @@
+A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
+Normal rank
@@ Property / cites work @@
+A time indexed formulation of non-preemptive single machine scheduling problems
+Normal rank
@@ Property / cites work @@
+Easily Computable Facets of the Knapsack Polytope
@@ Property / cites work: Easily Computable Facets of the Knapsack Polytope / rank @@
+Normal rank