scientific article; zbMATH DE number 4012297

MaRDI QIDQ3762059zbMATH OpenFDO

Authors Stanisław Zdrzałka

Publication date 1985

zbMATH Keywords

assembly lineheuristic algorithmsNP-completesingle machine schedulingworst case performance

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 4072689
• Bounds for Assembly Line Balancing Heuristics
• Assembly-line scheduling with concurrent operations and parallel machines
• scientific article; zbMATH DE number 4072697
• Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags

Cited in

(13)

• A note on minimum makespan assembly plans
• Single-machine scheduling with advanced process control constraints
• Assembly-line scheduling with concurrent operations and parallel machines
• A heuristic algorithm for a production planning problem in an assembly system
• Analysis of a linearization heuristic for single-machine scheduling to maximize profit
• Bounds for Assembly Line Balancing Heuristics
• Expected Behaviour of Line-Balancing Heuristics
• scientific article; zbMATH DE number 4072689 (Why is no real title available?)
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine
• The Line Segmentation Problem
• scientific article; zbMATH DE number 754571 (Why is no real title available?)
• Parameterized and Exact Computation
• scientific article; zbMATH DE number 2221022 (Why is no real title available?)

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 Q3762059)