A. Joly and Y. Frein, “Heuristics for an Industrial Car Sequencing Problem Considering Paint and Assembly Shope Objectives,” Computers & Industrial Engineering, Vol. 55, No. 2, 2008, pp. 295-310. doi:10.1016/j.cie.2007.12.014

has been cited by the following article:

• TITLE: Limited Resequencing for Mixed Models with Multiple Objectives

  AUTHORS: Patrick R. McMullen

  KEYWORDS: Sequencing, Heuristics, Simulated Annealing

  JOURNAL NAME: American Journal of Operations Research, Vol.1 No.4, December 5, 2011

  ABSTRACT: This research presents a problem relevant to production scheduling for mixed models – production schedules that contain several unique items, but each unique item may have multiple units that require processing. The presented research details a variant of this problem where, over multiple processes, resequencing is permitted to a small degree so as to exploit efficiencies with the intent of optimizing the objectives of required set-ups and parts usage rate via an efficient frontier. The problem is combinatorial in nature. Enumeration is used on a variety of test problems from the literature, and a search heuristic is used to compare optimal solutions with heuristic based solutions. Experimentation shows that the heuristic solutions approach optimality, but with opportunities for improvement.