Branch and bound algorithm for identical parallel machine scheduling problem to maximise system availability

Khoudi, Asmaa; Berrichi, Ali

doi:10.1504/ijmr.2020.108188

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Branch and bound algorithm for identical parallel machine scheduling problem to maximise system availability

Cited by 4 publications

References 0 publications

Improving the Efficiency of Minimum Determinant Computation in Space Time Trellis Code with Optimal Subtree Pruning

Improving the Efficiency of Minimum Determinant Computation in Space Time Trellis Code with Optimal Subtree Pruning

Joint Planning of Production and Inspection of Parallel Machines with Two-phase of Failure

Experimental Teaching Platform Development for Topological Sorting Algorithm Education

Contact Info

Product

Resources

About