Single facility due date setting with multiple customer classes
Article Abstract:
The problem of quoting due dates and sequencing customer orders in a manufacturing system is considered. In this problem, the production system is modeled as a single-server queue, and there are several different classes of customers with different price and lead time preferences. The problem is considered in both cases when customer orders are processed on a first-come, first-serve (FCFS) basis and when the manufacturer has the freedom to sequence orders using scheduling methods other than FCFS. The analysis seeks to demonstrate the importance of the use of customer preference information in the determination of due dates. It also introduces a framework for the application of such information when it is available. The results of a simulation study that tests due date setting rules are discussed.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1995
User Contributions:
Comment about this article or add new information about this topic:
Minimizing single-machine completion time variance
Article Abstract:
The problem of reducing the completion time variance in n-job, single-machine scheduling is analyzed. The problem is formulated as if all release times for all jobs are zero. A new quadratic integer programming formulation and a Lagrangian relaxation procedure are developed in an attempt to solve this problem. The Lagrangian solution procedure is formulated to determine a lower bound to the optimal objective value. The results of a computational study indicate that the lower bounds generated by the procedure are nearly equivalent to the best known objective values when the number of jobs is between 100 and 500. A new, two-stage heuristic algorithm which offers better solutions than the best-known heuristic is also introduced.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1995
User Contributions:
Comment about this article or add new information about this topic:
Nonorthogonal two-dimensional cutting patterns
Article Abstract:
A modest extra computational effort can result in realization of significant savings when nonorthogonal cutting patterns are utilized. Determination of the best way to cut a number of pieces of material from a reel is usually determined under the assumption that each piece has a side parallel to the reel edge. It may be attractive to consider patterns in which some pieces appear in an intermediate, tilted position when the material to be cut is homogeneous.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1987
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Risk management: the five pillars of corporate governance. Partnering with suppliers for customer satisfaction
- Abstracts: Mobilising tacit knowledge. Knowledge management: getting the people-factors right. Knowledge management in the innovation process: innovation as a dynamic capability
- Abstracts: Financial reporting in the 1990s. Why managers need three bottom lines
- Abstracts: Estimating loyalty and switching with an application to the automobile market
- Abstracts: Optimal linear opinion pools. Optimal pricing policy for the service facility offering a set of priority prices