Single-machine scheduling with release dates, due dates and family setup times
Article Abstract:
A study was conducted to consider the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to reduce the maximum lateness. This problem emerges from the frequent opposition in manufacturing between efficient production and delivery performance as well as between maximizing machine use by batching similar jobs and maximizing customer satisfaction by finishing jobs before their deadline. A branch-and-bound algorithm was developed and was found to solve almost all instances with a maximum of about 40 jobs to optimality. The principal algorithmic contribution is the lower bounding strategy for managing family setup times. This strategy, which involves ignoring setup times and substituting them with setup jobs, generates a relaxed problem with particular precedence constraints such that its preemptive version is solvable in O(n log n) time.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times
Article Abstract:
A Lagrangean-based heuristic for solving the dynamic multilevel multiitem lotsizing problem for general product structures and multiple capacity-constrained resources and setup times has been developed. The heuristic decomposes the problem into uncapacitated dynamic single-item, lotsizing problems with time-varying production cost. Solutions to the single-item lotsizing problems are used to compute a lower bound on the minimum value of the objective function, while a heuristic finite loading procedure is used to determine the upper bounds. The heuristic can be used within a rolling scheduling framework and is suitable for distributed resource-oriented Materials Requirements Planning systems.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
Single-stage resource allocation and economic lot scheduling on multiple, nonidentical production lines
Article Abstract:
A concave minimization approach to addressing the economic lot-scheduling problem (ELSP) was developed to cover nonidentical production lines. By assuming that production lines exhibit variable production rates and costs, the proposed approach centers on reducing the shortage penalty, inventory, long-run average production and setup costs. Through the use of the proposed approach it was confirmed that the ELSP problem concerning rotation cycle production lines follows a NP-complete solution. Empirical results show that the lower and upper bounds of the approach are within the 0.6% range, implying that total costs are more sensitive to target utilizations than setup time.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1999
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Cross-training decisions in field services with three job types and server-job mismatch. Managing risks in multiple online auctions: an options approach
- Abstracts: Market segmentation strategies and service sector productivity. Developing global strategies for service businesses
- Abstracts: Safeguarding microcomputers and LANs. Microcomputers For Financial Consulting. Achieving 'net' results
- Abstracts: Employee creativity: personal and contextual factors at work. Effects of work redesign on employee perceptions, attitudes, and behaviors: a long-term investigation
- Abstracts: Overcoming roadblocks. Productivity begins with hiring. The perfect match