Sagar U. Sapkal

Learn More
This paper proposes a penalty-shift-insertion (PSI)-based algorithm for the no-wait flow shop scheduling problem to minimize total flow time. In the first phase, a penalty-based heuristic, derived from Vogel's approximation method used for the classic transportation problem is used to generate an initial schedule. In the second phase, a known solution is(More)
— Since the no-wait flow shop scheduling problems have been proved to be NP-hard, heuristic procedures are considered as the most suitable ones for their solution, especially for large – sized problems. We present a constructive heuristic for minimizing total flow time criterion in no-wait flow shop scheduling problems. The proposed heuristic is based on(More)
  • 1