Open AccessThe NP-Completeness of Quay Crane Scheduling Problem
Author(s) -
Ali Skaf,
Samir Dawaliby,
Arezki Aberkane
Publication year - 2022
Publication title -
artificial intelligence and applications
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5121/csit.2022.121802
Subject(s) - job shop scheduling , integer programming , computational complexity theory , scheduling (production processes) , completeness (order theory) , time complexity , mathematical optimization , heuristic , computer science , mathematics , algorithm , mathematical analysis , schedule , operating system