scientific article; zbMATH DE number 1893571

zbMATH Open1010.68752MaRDI QIDQ4801192FDOQ4801192

Authors: Clint Hepner, Clifford Stein 

Publication date: 7 April 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2153/21530202.htm

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

Recommendations

• Algorithms and Computation
• A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
• Efficient approximation schemes for scheduling problems with release dates and delivery times
• PTAS for a two-machine flow-shop scheduling problem with release dates and transportation times delay
• The PTAS for the problem of \(P_m|r_j,B|\sum C_j\)

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Cited In (1)

• An exact approach to early/tardy scheduling with release dates

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