Counting and enumeration complexity with application to multicriteria scheduling (Q5920490)

scientific article; zbMATH DE number 5255854

Language	Label	Description	Also known as
English	Counting and enumeration complexity with application to multicriteria scheduling	scientific article; zbMATH DE number 5255854

Statements

instance of

scholarly article

0 references

title

Counting and enumeration complexity with application to multicriteria scheduling (English)

0 references

zbMATH Open document ID

1142.68038

0 references

DOI

10.1007/s10479-007-0175-3

0 references

author

Vincent T'kindt

0 references

Karima Bouibede-Hocine

0 references

Carl Esswein

0 references

published in

Annals of Operations Research

0 references

publication date

31 March 2008

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

multicriteria scheduling

0 references

complexity

0 references

counting

0 references

enumeration

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A composite heuristic for the single machine early/tardy job scheduling problem.

0 references

Q4258216

0 references

Scheduling job families about an unrestricted common due date on a single machine

0 references

Q4387183

0 references

Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach

0 references

Q4826104

0 references

Scheduling to minimize the weighted sum of completion times with secondary criteria

0 references

A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness

0 references

Single machine scheduling to minimize weighted earliness subject to no tardy jobs

0 references

Scheduling unit processing time jobs on a single machine with multiple criteria

0 references

Q3970631

0 references

One machine sequencing to minimize mean flow time with minimum number tardy

0 references

A branch and bound procedure to minimize mean absolute lateness on a single processor

0 references

Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.

0 references

Q4198056

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Local search heuristics for two-stage flow shop problems with secondary criterion

0 references

A note on the extension of a result on scheduling with secondary criteria

0 references

Q4002567

0 references

Minimizing Maximum Promptness and Maximum Lateness on a Single Machine

0 references

Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria

0 references

Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

0 references

On the interactive solution to a multicriteria scheduling problem

0 references

A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem

0 references

Performance enhancements to tabu search for the early/tardy scheduling problem

0 references

Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty

0 references

On generating all maximal independent sets

0 references

Optimal two- and three-stage production schedules with setup times included

0 references

Scheduling shops to minimize the weighted number of late jobs

0 references

Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates

0 references

Q4363257

0 references

Single-machine scheduling with time windows and earliness/tardiness penalties

0 references

Open shop scheduling with makespan and total completion time criteria

0 references

Single machine earliness and tardiness scheduling

0 references

Bicriterion scheduling in the two-machine flowshop

0 references

A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem

0 references

Hybrid algorithm for sequencing with bicriteria

0 references

A heuristic for single machine scheduling with early and tardy costs

0 references

Scheduling <i>n</i> Independent Jobs on <i>m</i> Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis

0 references

ONE MACHINE SCHEDULING PROBLEM WITH DUAL CRITERIA

0 references

A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem

0 references

Scheduling with Multiple Performance Measures: The One-Machine Case

0 references

Genetic algorithms for the two-stage bicriteria flowshop problem

0 references

The Single Machine Early/Tardy Problem

0 references

Q3221403

0 references

Q3525910

0 references

Two-Stage Flowshop Scheduling Problem with Bicriteria

0 references

Q3802899

0 references

A bicriteria two-machine permutation flowshop problem

0 references

Q4139697

0 references

Minimizing the sum of absolute lateness in single-machine and multimachine scheduling

0 references

Q4032003

0 references

Q3378953

0 references

Two-machine flowshop scheduling with a secondary criterion

0 references

Counting and enumeration complexity with application to multicriteria scheduling

0 references

Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria

0 references

Bicriterion scheduling of identical processing time jobs by uniform processors

0 references

The complexity of computing the permanent

0 references

The Complexity of Enumeration and Reliability Problems

0 references

Four solution techniques for a general one machine scheduling problem. A comparative study

0 references

A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date

0 references

Algorithms for a class of single-machine weighted tardiness and earliness problems

0 references

A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem

0 references

A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5920490