Journal ArticleDOI
Multi-period job selection: planning work loads to maximize profit
Reads0
Chats0
TLDR
This work examines the profitability of job selection decisions over a number of periods when current orders exceed capacity with the objective of maximizing profit, and finds one heuristic that produces near-optimal results for small problems, is tractable for larger problems, and requires the same information as the dynamic program.About:
This article is published in Computers & Operations Research.The article was published on 2002-07-01. It has received 89 citations till now. The article focuses on the topics: Heuristics & Heuristic.read more
Citations
More filters
Journal ArticleDOI
Order acceptance and scheduling: A taxonomy and review
TL;DR: A taxonomy and a review of this literature is presented, its contributions are cataloged, and opportunities for future research in this area are suggested.
Journal ArticleDOI
Order acceptance with weighted tardiness
TL;DR: Examination of order acceptance decisions when capacity is limited, customers receive a discount for late delivery, but early delivery is neither penalized nor rewarded, and a variety of fast and high-quality heuristics based on this approach.
Journal ArticleDOI
Order acceptance using genetic algorithms
Walter O. Rom,Susan A. Slotnick +1 more
TL;DR: A genetic algorithm is used to solve the problem of which orders to choose to maximize profit, when there is limited capacity and an order delivered after its due date incurs a tardiness penalty.
Journal ArticleDOI
Workload based order acceptance in job shop environments
TL;DR: This work investigates the importance of a good workload based order acceptance method in over-demanded job shop environments, and presents sophisticated methods that consider technological restrictions, such as precedence relations, and release and due dates of orders.
Journal ArticleDOI
Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
Fabrice Talla Nobibon,Roel Leus +1 more
TL;DR: It is proved that the existence of a constant-factor approximation algorithm for this problem is unlikely and two linear formulations that are solved using an IP solver are proposed able to solve instances with up to 50 jobs within reasonable CPU times are proposed.
References
More filters
Book
Scheduling: Theory, Algorithms, and Systems
TL;DR: Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments and Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource.
Journal ArticleDOI
Quoting customer lead times
Izak Duenyas,Wallace J. Hopp +1 more
TL;DR: In this article, the authors consider the problem of quoting customer lead times in a manufacturing environment under a variety of modeling assumptions and derive a closed-form expression for the optimal lead time quote.