Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling

1995 ◽  
Vol 46 (6) ◽  
pp. 753
Author(s):  
Wlodzimierz Szwarc ◽  
Samar K. Mukhopadhyay
Keyword(s):  
Cost Function ◽  
Single Machine ◽  
Waiting Times ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Quadratic Cost ◽  
Quadratic Cost Function

SOME GENERAL PROPERTIES OF A FUZZY SINGLE MACHINE SCHEDULING PROBLEM

2007 ◽  
Vol 15 (01) ◽  
pp. 43-56 ◽  
Author(s):  
ADAM KASPERSKI
Keyword(s):  
Cost Function ◽  
Classical Theory ◽  
Single Machine ◽  
Wide Class ◽  
Regular Function ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Precedence Relation ◽  
General Properties

In this paper a general formulation of a fuzzy single machine scheduling problem is proposed. Such notions as schedule, precedence relation and cost function in the fuzzy case are defined. The concept of f-regular function, being a generalization of a regular function, known from the classical theory of scheduling is introduced. A wide class of problems with f-regular cost functions is analyzed and some general properties of such problems are shown.

Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times

2015 ◽  
Vol 32 (05) ◽  
pp. 1550033 ◽  
Author(s):  
Xin-Jun Li ◽  
Jian-Jun Wang ◽  
Xue-Ru Wang
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Learning Effect ◽  
Waiting Times ◽  
Deteriorating Jobs ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Optimal Sequence ◽  
Processing Times ◽  
Convex Resource Allocation

This paper considers single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times, i.e., the processing time of a job is a function of its starting time, its position in a sequence and its convex resource allocation. The objective is to find the optimal sequence of jobs and the optimal convex resource allocation separately to minimize a cost function containing makespan, total completion (waiting) time, total absolute differences in completion (waiting) times and total resource cost. It is proved that the problem can be solved in polynomial time.

The Single Machine Problem with a Quadratic Cost Function of Completion Times

1988 ◽  
Vol 34 (12) ◽  
pp. 1480-1488 ◽  
Author(s):  
Wlodzimierz Szwarc ◽  
Marc E. Posner ◽  
John J. Liu
Keyword(s):  
Cost Function ◽  
Single Machine ◽  
Quadratic Cost ◽  
Quadratic Cost Function ◽  
Completion Times ◽  
Machine Problem
Sign in / Sign up

Export Citation Format

Share Document