共 50 条
- [41] A Branch and Bound Algorithm for the Two-Machine Blocking Flowshop Group Scheduling Problem ADVANCED INTELLIGENT COMPUTING TECHNOLOGY AND APPLICATIONS, ICIC 2023, PT I, 2023, 14086 : 322 - 332
- [42] Novel job based and machine based lower bound on makespan in jobshop scheduling problem PROCEEDINGS OF THE 8TH WSEAS INTERNATIONAL CONFERENCE ON SYSTEMS THEORY AND SCIENTIFIC COMPUTATION (ISTAC'08): NEW ASPECTS OF SYSTEMS THEORY AND SCIENTIFIC COMPUTATION, 2008, : 291 - +
- [46] Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs Journal of Scheduling, 2005, 8 : 161 - 177
- [47] Branch-and-bound algorithms for scheduling in anm-machine no-wait flowshop SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2020, 45 (01):
- [48] A new ILS algorithm for parallel machine scheduling problems Journal of Intelligent Manufacturing, 2006, 17 : 609 - 619