A Two-Agent Single-Machine Scheduling Problem with Learning and Deteriorating Considerations

Figure 1

Performance of the branch-and-bound algorithm (𝑛=15).