Showing 1 - 10 of 39
We consider the problem of scheduling multi-operation jobs on a singe machine to minimize the total completion time. Each job consists of several operations that belong to different families. In a schedule each family of job operations may be processed as batches with each batch incurring a...
Persistent link: https://www.econbiz.de/10005239992
The single-item capacitated economic lot-sizing (CELS) problem is a fundamental problem of production and inventory management. The first fully polynomial approximation scheme (FPTAS) for this problem with concave cost functions was developed by Van Hoesel and Wagelmans [C.P.M. Van Hoesel,...
Persistent link: https://www.econbiz.de/10005023373
Persistent link: https://www.econbiz.de/10005253497
Persistent link: https://www.econbiz.de/10005257053
Two agents, each having his own set of jobs, compete to perform their own jobs on a common processing resource. Each job of the agents has a weight that specifies its importance. The cost of the first agent is the maximum weighted completion time of his jobs while the cost of the second agent is...
Persistent link: https://www.econbiz.de/10009249564
This paper evaluates the effects of the distribution centre (DC) in a vendor-managed inventory (VMI) system comprising one manufacturer, one DC and n retailers. Adopting the order-up-to-level (OUL) replenishment policy, the system aims to maximize the overall system profit. We propose a model to...
Persistent link: https://www.econbiz.de/10008483234
This paper provides a comparative analysis of five possible production strategies for two kinds of flexibility investment, namely flexible technology and flexible capacity, under demand fluctuations. Each strategy is underpinned by a set of operations decisions on technology level, capacity...
Persistent link: https://www.econbiz.de/10009146070
We consider the problem of scheduling n deteriorating jobs with release dates on a single batching machine. Each job's processing time is an increasing simple linear function of its starting time. The machine can process up to b jobs simultaneously as a batch. The objective is to minimize the...
Persistent link: https://www.econbiz.de/10008865123
Problem Product Partition differs from the NP-complete problem Partition in that the addition operation is replaced by the multiplication operation. Furthermore it differs from the NP-complete problem Subset Product in that it does not contain the product value B in its input. We prove that...
Persistent link: https://www.econbiz.de/10008865333
Persistent link: https://www.econbiz.de/10005277675