scientific article; zbMATH DE number 3839671

MaRDI QIDQ3309440zbMATH OpenFDO

Authors Jozef Grabowski

Publication date 1982

zbMATH Keywords

branch-and-boundcomputational complexityNP-completenesspermutation flow - shop problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited in

(6)

• Adjustment of heads and tails for the job-shop problem
• Heuristic procedures for minimizing makespan and the number of required pallets
• Insertion techniques for the heuristic solution of the job shop problem
• Heuristics for permutation flow shop scheduling with batch setup times
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• On the combinatorial structure of the permutation flow shop problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3309440)