scientific article; zbMATH DE number 4158357

zbMATH Open0705.90037MaRDI QIDQ3486355FDOQ3486355

Authors: Stanisław Zdrzałka 

Publication date: 1989

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

Recommendations

• Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
• Batch Delivery Scheduling on a Single Machine
• A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times
• Batch-processing scheduling with setup times
• Minimizing makespan in batch machine scheduling

zbMATH Keywords

worst-case performance boundssingle machine sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (9)

• Batch-processing scheduling with setup times
• Single machine batch scheduling with release times
• Single machine scheduling with batch set-up times to minimize maximum lateness
• Single machine scheduling to minimize the setup time and the earliness
• Batch sizing and job sequencing on a single machine
• Approximation algorithms for problems in scheduling with set-ups
• Title not available (Why is that?)
• Split scheduling with uniform setup times
• Single machine scheduling with batch-dependent setup times

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