No-wait scheduling in supply chain environment

This paper presents an approach to schedule a project online in a supply chain without rescheduling or disturbing the previous schedules. The information at hand are the project requirements and the resources availability i.e. the busy status of resources. The objective is to find the shortest project completion time while following the no-wait strategy. Three algorithms are proposed. The first algorithm schedules the jobs online optimally for production processes that do not include assembly operations. The second algorithm utilizes the functionality of the first algorithm for scheduling the ordinary assembly processes (single assembly operation at the end of the processes). The third algorithm extends the approach of ordinary assembly process to schedule the complex assembly processes. A complex assembly process contains one assembly operation (if it is not the last one) or more than one assembly operations