This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.
The Job Shop Scheduling Problem (JSSP) is an NP-hard problem. 1 The JSSP is defined by a set of jobs that must be executed by a set of machines in a specific order for each job. Each job has a defined execution time for each machine and a defined processing order of machines. Also, each job must use each machine only once. The machines can only execute a job at a time and once started, the machine…
The Job Shop Scheduling Problem (JSSP) is an NP-hard problem. 1
The JSSP is defined by a set of jobs that must be executed by a set of machines in a specific order for each job. Each job has a defined execution time for each machine and a defined processing order of machines. Also, each job must use each machine only once. The machines can only execute a job at a time and once started, the machine cannot be interrupted until the completion of the assigned job.
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.