• Home
  • Search
  • Interactive Job Shop Scheduling: An Experiment
  • Cite Icon8
  • https://doi.org/10.1111/j.1540-5915.1991.tb01905.xCopy DOI Icon

Interactive Job Shop Scheduling: An Experiment

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

ABSTRACTAn experiment is discussed in which three computer‐aided, interactive job shop scheduling approaches are compared using an interactive job shop scheduling simulator (JOB) developed for the project. All three approaches use a combination of computer and human capabilities to develop job shop schedules, but differ in terms of the timing and degree of human involvement required.The three scheduling approaches are (1) the successive approach, (2) the interactive approach, and (3) the semi‐interactive approach. The successive approach is characterized by the computer scheduling all work orders without any human intervention. The interactive approach is distinguished by the human scheduling one work order at a time until all work orders are scheduled. The schedule is developed interactively by the person who must simultaneously consider work‐order scheduling needs and machine group load capacities. The semi‐interactive approach may be viewed as a combination of the successive and interactive approaches. Work orders are automatically scheduled one at a time using the successive approach criteria, but with prespecified machine‐group load thresholds. As long as the load threshold is not exceeded, the successive approach is used to schedule work orders. When a threshold is exceeded, the algorithm (successive approach) pauses and human rescheduling (interactive approach) is required to rectify the overload situation. A second (reallocation) phase, identical for all three approaches, is used to overcome any scheduling problems generated in phase one.Experimental results based on nine different performance criteria (including scheduling time, makespan, machine group utilization, and work‐in‐process inventory) and 45 experimental runs indicate that there are differences between the results produced by the three scheduling approaches. The interactive approach yields the best overall scheduling results, but the other two approaches are clearly better than the interactive approach in some situations. The success of the interactive approach indicates that it is usually best for the human scheduler to become involved early in the computer‐based job shop scheduling process.

Similar Papers
  • Research Article
  • Citations5

An interactive approach for a dual-constraint job shop scheduling problem

  • Jan 01, 1991
  • Computers & Industrial Engineering
  • Suna Kondakci +1
  • Conference Article
  • Citations2

Interactive simulation for easy decision-making in fluid dynamics

  • Oct 20, 2021
  • arXiv (Cornell University)
  • Mengchen Wang +3
  • Book Chapter

An Efficient Unidirectional Search Approach for Job Shop Scheduling

  • Jan 01, 1996
  • Jukka Siedentopf
  • Book Chapter
  • Citations10

A Heuristic Rule-Based Approach for Dynamic Scheduling of Flexible Manufacturing Systems

  • Dec 01, 2007
  • Gonca Tuncel
  • Research Article
  • Citations32

A column generation-based approach for proportionate flexible two-stage no-wait job shop scheduling

  • Mar 30, 2019
  • International Journal of Production Research
  • Zhi Pei +3
  • Research Article

Reinforcing optimization enabled interactive approach for liver tumor extraction in computed tomography images

  • Aug 01, 2023
  • International Journal of Power Electronics and Drive Systems/International Journal of Electrical and Computer Engineering
  • Jayanthi Muthuswamy +2
  • Research Article
  • Citations8

New Hybrid Parallel Algorithm for Variable-sized Batch Splitting Scheduling with Alternative Machines in Job Shops

  • Jan 01, 2010
  • Chinese Journal of Mechanical Engineering
  • Yanwei Zhao
  • Dissertation

A MILP model for flexible job shop scheduling problem considering low flexibility

  • Jan 01, 2024
  • Minzheng Liu
  • Conference Article
  • Citations16

A genetic algorithm for job-shop scheduling in a semiconductor manufacturing system

  • Nov 29, 1999
  • S Cavalieri +2
  • Book Chapter
  • Citations6

Declarative Decomposition and Dispatching for Large-Scale Job-Shop Scheduling

  • Jan 01, 2016
  • Giacomo Da Col +1
  • Research Article
  • Citations24

Scheduling on Unrelated Machines under Tree-Like Precedence Constraints

  • Sep 15, 2007
  • Algorithmica
  • V S Anil Kumar +3
  • Research Article
  • Citations20

An interactive multi-objective programming approach for project portfolio selection and scheduling

  • Apr 25, 2022
  • Computers & Industrial Engineering
  • Özge Şahin Zorluoğlu +1
  • Research Article
  • Citations61

Simulation studies in job shop scheduling—II: Performance of priority rules

  • Jan 01, 1984
  • Computers & Industrial Engineering
  • Ali S Kiran +1
  • Conference Article

Interactive pattern analysis and recognition-A review and an outlook

  • Dec 01, 1972
  • Y Chien
  • Research Article
  • Citations3

Towards typogenetic tools for generative urban aesthetics

  • Apr 03, 2018
  • Smart and Sustainable Built Environment
  • Manuel Muehlbauer
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.