Determination of common due window location in a single machine scheduling problem

Article Abstract:

An O(n log n) algorithm is proposed to solve the static deterministic single machine scheduling problem where all jobs have a common due window. Jobs that are completed within the window have no penalty. The window size is assumed as a given parameter while the earliest due date is a decision variable which involves a linear cost component. The objective is to find the optimal sequence and the optimal common due window location.

Management, Just in time inventory systems, Just in time systems

---

Using tabu search with longer-term memory and relaxation to create examination timetables

Article Abstract:

A tabu search based algorithm called OTTABU that creates examination timetables, have a heuristically minimized penalty function. Two tabu lists, a tabu relaxation policy and several other novel features are incorporated in this algorithm.

Internet/Web search services, Search engines, Internet search software, Internet/Web search service, Text search and retrieval software

---

Batch scheduling in a two-level supply chain - a focus on the supplier

Article Abstract:

A study examines batch scheduling problem faced by suppliers, who have to maintain optimum inventory levels. A polynomial time algorithm is used in the study.

Canada, Time management

Similar abstracts:

• Abstracts: How to take customers into consideration in service innovation projects. The effect of organizational vision on service quality delivery
• Abstracts: Iterative restart technique for solving timetabling problems. Memetic algorithm timetabling for non-commercial sport leagues
• Abstracts: Comparison of iterative improvement techniques for schedule optimization. Local search for shift design

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