What question did this study set out to answer?

This research aims to develop algorithms that optimize scheduling in job-shop environments.

Scheduling the General Job-Shop

View Full Paper

Ask AI

Bookmark

Authors

Randomized trial explores conflict-based scheduling in job-shops, suggesting improved efficiencies.

This research aims to develop algorithms that optimize scheduling in job-shop environments.
Described a family of branch and bound algorithms for scheduling.
Each node in the search tree is associated with a complete schedule.
Branching from nodes is based on identifying significant conflicts in the schedule.
Demonstrated that the proposed algorithms can effectively find optimum schedules.
Provided results highlighting the efficiency of the algorithms in resolving conflicts.

Barker et al. (1985) studied this question.

View Full Paper

Ask AI

Bookmark