A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems

Article Abstract:

A heuristic for solving dynamic single-machine scheduling problems with the objective of minimizing the total weighted earliness and tardiness penalties was considered. Specifically, the computational complexity of a decision theory-based single-pass heuristic for generating schedules with idle times between jobs was quantified via its application to 116 published problems. The results, which were also compared to other dispatching procedures, proved the efficiency and effectiveness of the single-pass heuristic.

Decision theory

---

Improved heuristics for sequencing cutting patterns

Article Abstract:

Several new heuristic procedures for solving the trim loss or cutting stock problem are proposed. The heuristics, which deal with cutting pattern sequencing, minimize both the maximum queue of partially cut orders and the overall stacks queue. Based on simulations made by running the Fortran programs of the heuristics, two heuristics satisfied the objective function and exhibited optimality for sets with up to 30 pattern types.

---

Establishing the optimality of sequencing heuristics for cutting stock problems

Article Abstract:

Two exact methods for determining the optimum queues of partially cut patterns and for evaluating the optimality of heuristic procedures to resolve one-dimensional cutting stock problems are presented. The first, otherwise known as the Lower Bound method, finds disjoint subgroups of pattern based on graph theory. The second is an implicit exhaustive search of all possible sequences in an outcomes tree.

Search theory

Similar abstracts:

• Abstracts: Simultaneous determination of the cutting speed and lot size values in machining systems. Production lot sizing in failure prone two-stage serial systems
• Abstracts: Century Hotel's staying power. Accor Asia sets unit to fund new hotels. Hong Kong hotel-management firm uses an owner-friendly approach
• Abstracts: Heuristic approaches for n/m/F/sigma Ci scheduling problems. Heuristic procedure for minimizing makespan and the number of required pallets
• Abstracts: Role reversal: London and Beijing prepare to trade places. Here come the jitters. Tightening the bolts
• Abstracts: Tongue-tied: opposition comes under fire for being too coy. Anybody's man: Chavalit's power bid recalls old-style Thai politics

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.