Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times

Authors:
Mehdi Iranpoor;S. M. T. Fatemi Ghomi;M. Zandieh
Affiliations:
Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, 1591634311 Tehran, Iran;Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, 1591634311 Tehran, Iran;Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, G.C., Tehran, Iran
Venue:
Computers and Operations Research
Year:
2013

Citing 16
Cited 0

An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions

Computers and Operations Research
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times

Computers and Operations Research
Due date assignments and scheduling a single machine with a general earliness/tardiness cost function

Computers and Operations Research
A note: Common due date assignment for a single machine scheduling with the rate-modifying activity

Computers and Operations Research
Scheduling with uncertain durations: Modeling β-robust scheduling with constraints

Computers and Operations Research
Scheduling a maintenance activity and due-window assignment on a single machine

Computers and Operations Research
Solving a stochastic single machine problem with initial idle time and quadratic objective

Computers and Operations Research
Setting due dates in a stochastic single machine environment

Computers and Operations Research
Optimal due date assignment and resource allocation in a group technology scheduling environment

Computers and Operations Research
Scheduling deteriorating jobs on a single machine subject to breakdowns

Journal of Scheduling
Makespan minimization on single batch-processing machine via ant colony optimization

Computers and Operations Research
A GRASP approach for makespan minimization on parallel batch processing machines

Journal of Intelligent Manufacturing
A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity

Computers and Operations Research
An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times

Computers and Operations Research
Decomposition-based classified ant colony optimization algorithm for scheduling semiconductor wafer fabrication system

Computers and Industrial Engineering
Development of a decision support system for supplier evaluation and order allocation

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

Due date assignment combined with shop floor scheduling has attracted enormous amount of research, in recent years. In many make-to-order situations, the processing times are not known exactly in advance. Further, machine rates are not constant at different times. We assume the case where the machine rate is low at the beginning of the scheduling horizon. However, it can be brought back to normal rate by performing a maintenance activity. The problem includes assigning due-dates and scheduling the jobs and maintenance activity on a single machine where the processing times are stochastic. The objective is minimizing the total cost of lengths of quoted due-dates and expected deviations of completion times from declared due-dates. The optimal solutions of medium-sized problems are found by solving some nonlinear programming models. For larger problems, robust metaheuristics are developed and their performances are statistically analyzed.