scientific article; zbMATH DE number 895359

zbMATH Open0847.90079MaRDI QIDQ4883371FDOQ4883371

Authors: Bo Chen, Gerhard J. Woeginger 

Publication date: 1 July 1996

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

Recommendations

• On-line scheduling of small open shops
• On-line and semi-online scheduling for flow shop problems on two machines
• A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
• On-line scheduling of two-machine open shops where jobs arrive over time

zbMATH Keywords

worst-case performanceon-line schedulingmaximum completion timetwo-stage shops

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (14)

• On-line and off-line preemptive two-machine job shop scheduling
• On-line two-machine open shop scheduling with time lags
• Online scheduling of ordered flow shops
• On-line scheduling of small open shops
• New results on two-machine flow-shop scheduling with rejection
• On-line and semi-online scheduling for flow shop problems on two machines
• Competitive algorithms for multistage online scheduling
• On-line service scheduling
• Worst-case analysis for on-line service policies
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
• On-line two-machine job shop scheduling with time lags
• On two-machine flow shop scheduling

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