Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine

doi 10.1145/237814.237989
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Minimizing Total Tardiness for Single Machine Sequencing

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1996English

A Polynomial Time Constant Approximation for Minimizing Total Weighted Flow-Time

2019English

Minimizing Total Weighted Tardiness for the Single Machine Scheduling Problem With Dependent Setup Time and Precedence Constraints

Management Science Letters
AccountingManagementBusiness
2012English

WSPT's Competitive Performance for Minimizing the Total Weighted Flow Time: From Single to Parallel Machines

Mathematical Problems in Engineering
MathematicsEngineering
2013English

Heuristics for Minimizing the Number of Tardy Jobs on a Single Machine With Release Time

South African Journal of Industrial Engineering
IndustrialManufacturing Engineering
2012English

Minimizing Total Completion Time in Flowshop With Availability Constraint on the First Machine

2016English

Rule Based Heuristic Approach for Minimizing Total Flow Time in Permutation Flow Shop Scheduling

Tehnicki Vjesnik
Engineering
2015English

A Matheuristic Approach for the Two-Machine Total Completion Time Flow Shop Problem

Annals of Operations Research
Management ScienceDecision SciencesOperations Research
2011English

Minimizing Average Flow-Time : Upper and Lower Bounds

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Computer NetworksOpticsMolecular Physics,CommunicationsOpticalAtomicMagnetic MaterialsElectronic
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy