scientific article; zbMATH DE number 4012297

zbMATH Open0623.90036MaRDI QIDQ3762059FDOQ3762059

Authors: Stanisław Zdrzałka 

Publication date: 1985

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

single machine schedulingNP-completeheuristic algorithmsassembly lineworst case performance

Mathematics Subject Classification ID

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

Cited In (12)

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

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)