scientific article; zbMATH DE number 2080976

zbMATH Open1077.68955MaRDI QIDQ4474071FDOQ4474071

Authors: Haodi Feng, Pixing Zhang, Hong Zhu, Xiaotie Deng 

Publication date: 4 August 2004

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

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

Recommendations

• Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
• A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
• scientific article; zbMATH DE number 5059917
• scientific article; zbMATH DE number 2086930
• Minimizing total weighted completion time on parallel unbounded batch machines

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cited In (9)

• Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness
• A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
• Minimizing total weighted completion time on parallel unbounded batch machines
• Minimizing mean completion time in a batch processing system
• Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
• Title not available (Why is that?)
• ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
• A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions
• Title not available (Why is that?)

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