Job shop scheduling with makespan objective: A heuristic approach

Abstract

Job shop has been considered as one of the most challenging scheduling problems and there are literally tremendous efforts on reducing the complexity of solution procedure for solving job shop problem. This paper presents a heuristic method to minimize makespan for different jobs in a job shop scheduling. The proposed model is based on a constructive procedure to obtain good quality schedules, very quickly. The performance of the proposed model of this paper is examined on standard benchmarks from the literature in order to evaluate its performance. Computational results show that, despite its simplicity, the proposed heuristic is computationally efficient and practical approach for the problem.

A Hybrid Algorithm using Grey Wolf and Chicken Swarm for Flexible Job Shop Scheduling

“…Wisittipanich and Kachitvichyanukul (2012) proposed a concept makespan problem to solve using two enhanced differential evolution algorithms for, minimize job scheduling makespan tardiness by doing an equal balance of analysis and consumption ability in differential evolution algorithms [17]. Ziaee et al, (2014) proposed Job shop scheduling with makespan objective: A heuristic approach, this method minimizing the makespan of jobs for JSSP and discovered a solution for good schedules frequently [18].…”