Single machine scheduling subject to deadlines and resource dependent processing times

Article Abstract:

Single machine scheduling problems with the objective of minimizing the total weighted resource consumption under resource dependent processing times and precedence constraints were investigated. Specifically, it was shown that problems constrained by continuously divisible resource may be solved in O(n log n) time. In contrast, problems with discrete resource were shown to be NP-hard. To this end, end, a polynomial approximation procedure for solving general problems with discrete resource was developed.

Operations research, Research, Management science, Case studies, Resource allocation

---

Simultaneous minimization of total completion time and total deviation of job completion times

Article Abstract:

A single-machine scheduling problem with the objective of minimizing a linear combination of total job completion times and total deviation of job completion times from a common due-date is discussed. A pseudo-polynomial dynamic programming algorithm, indicating that this case is NP-hard in the ordinary sense, performs extremely well when tested on high-multiplicity instances with up to 1000 jobs.

Usage, Algorithms, Algorithm

---

Single machine batch scheduling with jointly compressible setup and processing times

Article Abstract:

The problem of a single machine batch scheduling is addressed. A batch is described as a set of jobs processed contiguously and completed together when the processing of all jobs in the batch is finished.

Business Personnel Management, Human resource management

Similar abstracts:

• Abstracts: Scheduling with monotonous earliness and tardiness penalties. Earliness-tardiness production planning for just-in-time manufacturing: a unifying approach by goal programming
• Abstracts: An iterative algorithm for scheduling UET tasks with due dates and release times. Insertion techniques for static and dynamic resource-constrained project scheduling
• Abstracts: A crane scheduling method for port container terminals. Three-dimensional packing of items with limited load bearing strength
• Abstracts: Modeling staff scheduling problems: a tutorial. Parallel machine scheduling with a convex resource consumption function
• Abstracts: Determination of common due window location in a single machine scheduling problem. Using tabu search with longer-term memory and relaxation to create examination timetables

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