Single machine scheduling with batch deliveries

Article Abstract:

Single machine batch scheduling problems with the objective of minimizing the batch delivery and job earliness penalties are considered. Such problems, which are similar to the parallel machine scheduling problem, require the concurrent determination of the number of batches, the division of jobs into batches and a job sequence. To solve them, polynomial time algorithms for general cases and dynamic programming algorithms for NP-hard versions of the problem are presented.

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

---

Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness

Article Abstract:

The appropriate scheduling of parallel machines with PPW (processing-plus-wait) due dates was studied to minimize maximum absolute lateness. The problem was classified as strongly NP-hard when the number of machines is variable but ordinary NP-hard when the machines are greater than or less than two. The classification of the problem, however, could not be determined and necessitates further research when the number of machines is constant.

Construction, Production Management, Models, Management, Construction industry

---

Similar abstracts:

• Abstracts: Open shop with job overlap - revisited. Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs
• Abstracts: Robust scheduling of parallel machines with sequence-dependent set-up costs. Value at risk methodology under soft conditions approach (fuzzy-stochastic approach)
• Abstracts: Production scheduling in a flexible manufacturing system under random demand. Resolution of a scheduling problem in a flowshop robotic cell
• Abstracts: Rendezvous search on the line with bounded resources: expected time minimization. A goal programming approach to group decision making based on multiplicative preference relations and fuzzy preference relations
• Abstracts: A two-bottleneck system with binomial yields and rigid demand

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