A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (Q5937715): Difference between revisions

Latest revision as of 18:23, 3 June 2024

scientific article; zbMATH DE number 1620088

Language	Label	Description	Also known as
English	A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times	scientific article; zbMATH DE number 1620088

Statements

instance of

scholarly article

0 references

title

A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (English)

0 references

zbMATH Open document ID

0983.90019

0 references

DOI

10.1016/S0377-2217(99)00415-4

0 references

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

12 July 2001

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

permutation flow shop

0 references

makespan

0 references

release times

0 references

branch-and-bound algorithm

0 references

fuzzy search strategy

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems

0 references

Two branch and bound algorithms for the permutation flow shop problem

0 references

A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem

0 references

Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops

0 references

Q4658190

0 references

The Complexity of Flowshop and Jobshop Scheduling

0 references

On two-machine scheduling with release and due dates to minimize maximum lateness

0 references

On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

An algorithm for single machine sequencing with release dates to minimize total weighted completion time

0 references

Some simple scheduling algorithms

0 references

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

0 references

A General Bounding Scheme for the Permutation Flow-Shop Problem

0 references

Q4124328

0 references

On lower bounds on the minimum maximum lateness on one machine subject to release date

0 references

An adaptive branching rule for the permutation flow-shop problem

0 references

Minimising makespan in the two-machine flow-shop with release times

0 references

Some efficient heuristic methods for the flow shop sequencing problem

0 references

Benchmarks for basic scheduling problems

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5937715

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems
+Normal rank
@@ Property / cites work @@
+Two branch and bound algorithms for the permutation flow shop problem
+Normal rank
@@ Property / cites work @@
+A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
+Normal rank
@@ Property / cites work @@
+Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
+Normal rank
@@ Property / cites work @@
+Q4658190
@@ Property / cites work: Q4658190 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+On two-machine scheduling with release and due dates to minimize maximum lateness
+Normal rank
@@ Property / cites work @@
+On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+An algorithm for single machine sequencing with release dates to minimize total weighted completion time
+Normal rank
@@ Property / cites work @@
+Some simple scheduling algorithms
@@ Property / cites work: Some simple scheduling algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+A General Bounding Scheme for the Permutation Flow-Shop Problem
+Normal rank
@@ Property / cites work @@
+Q4124328
@@ Property / cites work: Q4124328 / rank @@
+Normal rank
@@ Property / cites work @@
+On lower bounds on the minimum maximum lateness on one machine subject to release date
+Normal rank
@@ Property / cites work @@
+An adaptive branching rule for the permutation flow-shop problem
+Normal rank
@@ Property / cites work @@
+Minimising makespan in the two-machine flow-shop with release times
+Normal rank
@@ Property / cites work @@
+Some efficient heuristic methods for the flow shop sequencing problem
+Normal rank
@@ Property / cites work @@
+Benchmarks for basic scheduling problems
@@ Property / cites work: Benchmarks for basic scheduling problems / rank @@
+Normal rank