Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

COR
2006

favoriteEmaildiscussreport

86views more COR 2006»

Minimizing the earliness-tardiness costs on a single machine

13 years 4 months ago

Minimizing the earliness-tardiness costs on a single machine

Download www.cs.put.poznan.pl

In this paper the one-machine scheduling problem with linear earliness and tardiness costs is considered. The7 cost functions are job dependent and asymmetric. The problem consists of two sub-problems. The first one is to find a sequence of jobs and the second one is to find the job completion times that are optimal for the given sequence.9 We consider the second sub-problem and propose an algorithm solving the problem in O(n log n) time. 2005 Published by Elsevier Ltd.11

Jakub Bauman, Joanna Józefowska

Real-time Traffic

COR 2006 | Linear Earliness | One-machine Scheduling Problem | Tardiness Costs |

claim paper

Related Content

» New Solution Approaches to the General Single Machine EarlinessTardiness Problem

» Minimizing total busy time in parallel scheduling with application to optical networks

» Low Bias Bagged Support Vector Machines

» Online scheduling of unit time jobs with rejection minimizing the total completion time

» Considering manufacturing cost and scheduling performance on a CNC turning machine

» AverageCase Active Learning with Costs

» Encouraging Cooperation in Sharing Supermodular Costs

» Minimizing makespan with multipleordersperjob in a twomachine flowshop

» Incorporating Ondemand Stereo for Real Time Recognition

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COR
Authors	Jakub Bauman, Joanna Józefowska

Comments (0)