A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (Q497951): Difference between revisions

Latest revision as of 19:22, 10 July 2024

scientific article

Language	Label	Description	Also known as
English	A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects	scientific article

Statements

instance of

scholarly article

0 references

title

A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (English)

0 references

0 references

0 references

0 references

0 references

0 references

25 September 2015

0 references

zbMATH Keywords

scheduling

0 references

single-machine

0 references

tardiness

0 references

learning effect

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ins.2013.07.026

0 references

cites work

Scheduling jobs with position-dependent processing times

0 references

A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates

0 references

Single-machine scheduling with learning considerations

0 references

A state-of-the-art review on scheduling with learning effects

0 references

On decomposition of the total tardiness problem

0 references

Single machine scheduling with learning effect considerations

0 references

Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects

0 references

Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations

0 references

Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem

0 references

Q3993992

0 references

The two-machine total completion time flow shop problem

0 references

One-Machine Sequencing to Minimize Certain Functions of Job Tardiness

0 references

A new approach to the learning effect: Beyond the learning curve restrictions

0 references

Using artificial bees to solve partitioning and scheduling problems in codesign

0 references

The single-machine total tardiness scheduling problem: review and extensions

0 references

Single-machine and two-machine flowshop scheduling with general learning functions

0 references

Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect

0 references

Single-machine group scheduling with a time-dependent learning effect

0 references

Q4124332

0 references

A bi-criterion single-machine scheduling problem with learning considerations

0 references

A decomposition algorithm for the single machine total tardiness problem

0 references

An artificial bee colony algorithm for the maximally diverse grouping problem

0 references

Solution of the single machine total tardiness problem

0 references

Minimizing total tardiness on a single machine with unequal release dates

0 references

A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs

0 references

A due-date assignment problem with learning effect and deteriorating jobs

0 references

Single machine multiple common due dates scheduling with learning effects

0 references

A revision of machine scheduling problems with a general learning effect

0 references

Single-machine scheduling problems with a learning effect

0 references

Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption

0 references

Some scheduling problems with general position-dependent and time-dependent learning effects

0 references

Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects''

0 references

Identifiers

zbMATH Open document ID

1321.90062

0 references

DOI

10.1016/j.ins.2013.07.026

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:497951

@@ Property / cites work @@
+Scheduling jobs with position-dependent processing times
+Normal rank
@@ Property / cites work @@
+A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with learning considerations
+Normal rank
@@ Property / cites work @@
+A state-of-the-art review on scheduling with learning effects
+Normal rank
@@ Property / cites work @@
+On decomposition of the total tardiness problem
@@ Property / cites work: On decomposition of the total tardiness problem / rank @@
+Normal rank
@@ Property / cites work @@
+Single machine scheduling with learning effect considerations
+Normal rank
@@ Property / cites work @@
+Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
+Normal rank
@@ Property / cites work @@
+Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
+Normal rank
@@ Property / cites work @@
+Q3993992
@@ Property / cites work: Q3993992 / rank @@
+Normal rank
@@ Property / cites work @@
+The two-machine total completion time flow shop problem
+Normal rank
@@ Property / cites work @@
+One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
+Normal rank
@@ Property / cites work @@
+A new approach to the learning effect: Beyond the learning curve restrictions
+Normal rank
@@ Property / cites work @@
+Using artificial bees to solve partitioning and scheduling problems in codesign
+Normal rank
@@ Property / cites work @@
+The single-machine total tardiness scheduling problem: review and extensions
+Normal rank
@@ Property / cites work @@
+Single-machine and two-machine flowshop scheduling with general learning functions
+Normal rank
@@ Property / cites work @@
+Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
+Normal rank
@@ Property / cites work @@
+Single-machine group scheduling with a time-dependent learning effect
+Normal rank
@@ Property / cites work @@
+Q4124332
@@ Property / cites work: Q4124332 / rank @@
+Normal rank
@@ Property / cites work @@
+A bi-criterion single-machine scheduling problem with learning considerations
+Normal rank
@@ Property / cites work @@
+A decomposition algorithm for the single machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+An artificial bee colony algorithm for the maximally diverse grouping problem
+Normal rank
@@ Property / cites work @@
+Solution of the single machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+Minimizing total tardiness on a single machine with unequal release dates
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
+Normal rank
@@ Property / cites work @@
+A due-date assignment problem with learning effect and deteriorating jobs
+Normal rank
@@ Property / cites work @@
+Single machine multiple common due dates scheduling with learning effects
+Normal rank
@@ Property / cites work @@
+A revision of machine scheduling problems with a general learning effect
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling problems with a learning effect
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption
+Normal rank
@@ Property / cites work @@
+Some scheduling problems with general position-dependent and time-dependent learning effects
+Normal rank
@@ Property / cites work @@
+Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects''
+Normal rank