Single Machine Due Window Assignment and Scheduling with an Optional Maintenance Activity

Wei Xuan Li; Chuan Li Zhao

doi:10.4028/www.scientific.net/AMR.1006-1007.437

Paper Titles

The Research on the Digital Simulation Software of the Planer Double-Enveloping Toroidal Worm
p.419

Application of Improved Genetic Algorithm in Optimum Configuration of Viscous Dampers in Tall Buildings
p.423

A Simulation and Optimization Study of Assemble Production Line
p.427

Optimal Scheduling of Multiple-Line Collaborative Manufacturing Based on Teaching-Learning-Based Optimization Algorithm
p.432

Single Machine Due Window Assignment and Scheduling with an Optional Maintenance Activity
p.437

Based on the State of Emergency Safety Assessment Method of Airlines Dispatch Operation
p.441

Dynamic Game Algorithm for Allocation Model of Human Resource Based on Multi-Projects
p.447

Selection Algorithm of Developing New Products in Complex Environmental Constraints
p.453

Spare-Part Optimization Modeling for a Mixed Multi-Echelon Inventory System
p.459

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 1006-1007Single Machine Due Window Assignment and...

Single Machine Due Window Assignment and Scheduling with an Optional Maintenance Activity

Abstract:

This paper considers single machine scheduling with general position-dependent and job-dependent aging effect. All jobs share a common due window, and an optional maintenance activity (OMA) is taken into consideration. The processing time of a job is a non-decreasing function in its position. Such category of maintenance activity is called the OMA since one can determine the position and the actual duration of it. The objective is to determine the optimal due window position, the optimal location and duration of the OMA, and the optimal job sequence so as to minimize the total of earliness, tardiness, due window starting time, due window size, and the OMA duration related costs. We show that the considered problem can be solved in polynomial time.