A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times (Q2572851): Difference between revisions

Revision as of 09:12, 11 June 2024

scientific article

Language	Label	Description	Also known as
English	A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times	scientific article

Statements

instance of

scholarly article

0 references

title

A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times (English)

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

4 November 2005

0 references

zbMATH Keywords

Scheduling

0 references

Distributed database

0 references

Flowshop

0 references

Total completion time

0 references

Dominance relation

0 references

Lower and upper bounds

0 references

Branch-and-bound

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2004.07.074

0 references

cites work

Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop

0 references

Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns

0 references

Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times

0 references

Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications

0 references

Scheduling tasks with sequence-dependent processing times

0 references

Two-machine flowshop scheduling to minimize mean flow time

0 references

Q3993992

0 references

A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times

0 references

An improved branch-and-bound algorithm for the two machine total completion time flow shop problem

0 references

Job lateness in a two-machine flowshop with setup times separated

0 references

Q4692527

0 references

Flowshop and Jobshop Schedules: Complexity and Approximation

0 references

Impact of sequence-dependent setup time on job shop scheduling performance

0 references

Q4057549

0 references

An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times

0 references

Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.

0 references

Scheduling a flowline manufacturing cell with sequence dependent family setup times

0 references

A MILP model for the<i>n</i>-job,<i>M</i>-stage flowshop with sequence dependent set-up times

0 references

Q3989986

0 references

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

0 references

Identifiers

zbMATH Open document ID

1079.90046

0 references

DOI

10.1016/j.ejor.2004.07.074

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2572851

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2004.07.074
+Normal rank
@@ Property / OpenAlex ID @@
+W2042261753
@@ Property / OpenAlex ID: W2042261753 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
+Normal rank
@@ Property / cites work @@
+Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns
+Normal rank
@@ Property / cites work @@
+Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
+Normal rank
@@ Property / cites work @@
+Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
+Normal rank
@@ Property / cites work @@
+Scheduling tasks with sequence-dependent processing times
+Normal rank
@@ Property / cites work @@
+Two-machine flowshop scheduling to minimize mean flow time
+Normal rank
@@ Property / cites work @@
+Q3993992
@@ Property / cites work: Q3993992 / rank @@
+Normal rank
@@ Property / cites work @@
+A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
+Normal rank
@@ Property / cites work @@
+An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
+Normal rank
@@ Property / cites work @@
+Job lateness in a two-machine flowshop with setup times separated
+Normal rank
@@ Property / cites work @@
+Q4692527
@@ Property / cites work: Q4692527 / rank @@
+Normal rank
@@ Property / cites work @@
+Flowshop and Jobshop Schedules: Complexity and Approximation
+Normal rank
@@ Property / cites work @@
+Impact of sequence-dependent setup time on job shop scheduling performance
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
+Normal rank
@@ Property / cites work @@
+Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
+Normal rank
@@ Property / cites work @@
+Scheduling a flowline manufacturing cell with sequence dependent family setup times
+Normal rank
@@ Property / cites work @@
+A MILP model for the<i>n</i>-job,<i>M</i>-stage flowshop with sequence dependent set-up times
+Normal rank
@@ Property / cites work @@
+Q3989986
@@ Property / cites work: Q3989986 / rank @@
+Normal rank
@@ Property / cites work @@
+A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem
+Normal rank