We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
We consider large volume job shop scheduling problems, in which there is a fixed number of machines, a bounded number of activities per job, and a large number of jobs. In large v...
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
S. M. Kamrul Hasan, Ruhul A. Sarker, David Cornfor...
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...