Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Thomas Tautenhahn
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
Related publications
Minimizing Total Tardiness for Single Machine Sequencing
Journal of the Operations Research Society of Japan
Management Science
Decision Sciences
Operations Research
A Polynomial Time Constant Approximation for Minimizing Total Weighted Flow-Time
Minimizing Total Weighted Tardiness for the Single Machine Scheduling Problem With Dependent Setup Time and Precedence Constraints
Management Science Letters
Accounting
Management
Business
WSPT's Competitive Performance for Minimizing the Total Weighted Flow Time: From Single to Parallel Machines
Mathematical Problems in Engineering
Mathematics
Engineering
Heuristics for Minimizing the Number of Tardy Jobs on a Single Machine With Release Time
South African Journal of Industrial Engineering
Industrial
Manufacturing Engineering
Minimizing Total Completion Time in Flowshop With Availability Constraint on the First Machine
Rule Based Heuristic Approach for Minimizing Total Flow Time in Permutation Flow Shop Scheduling
Tehnicki Vjesnik
Engineering
A Matheuristic Approach for the Two-Machine Total Completion Time Flow Shop Problem
Annals of Operations Research
Management Science
Decision Sciences
Operations Research
Minimizing Average Flow-Time : Upper and Lower Bounds
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Computer Networks
Optics
Molecular Physics,
Communications
Optical
Atomic
Magnetic Materials
Electronic