Here we have n jobs on one machine where the processing times are triangular fuzzy numbers. The available to process without interruption. purpose is find a best sequence of that minimizes total completion and maximum tardiness. In this paper new definition presented called D-strongly positive number, then an exact solution problem through found. This opens ideas about converting scheduling pro...

The research focuses on the multi-objective single-machine static scheduling problems of motorcycle crankcase cover. To solve these problems, dispatching rules are used. Various used in this study earliest due date (EDD), shortest processing time (SPT), critical ratio (CR), longest (LPT), weightage (WSPT), cost over (COVERT), and hodgson’s algorithm. objective paper is to sequence different cov...

In many production processes real time information may be obtained from process control computers and other monitoring systems, but most existing scheduling models are unable to use this information to effectively influence scheduling decisions in real time. In this paper we develop a general framework for using real time information to improve scheduling decisions, which allows us to trade off...

We consider a nonpreemptive single-machine scheduling problem to minimize mean squared deviation of job completion times about a common due date with maximum tardiness constraint (MSD/Tmax problem), where the common due date is large enough so that it does not constrain the minimization of MSD. The MSD/Tmax problem is classi®ed into three cases according to the value of maximum allowable tardin...

A single machine scheduling problem with delivery time is considered. Job’s delivery time has deterioration effect. For the same processing time model of minimizing different objectives, it is given optimal sequences, respectively. For the same deterioration ratio model, we also give optimal sequences for different objectives. Mathematics Subject Classification: 91A35

This paper develops a fuzzy multi-objective linear programming (FMOLP) model for solving a multiobjective single-machine scheduling problem. The proposed model attempts to minimize the total weighted tardiness andmakespan simultaneously. In this problem, a proposed FMOLPmethod is applied with respect to the overall acceptable degree of thedecisionmaker (DM) satisfaction. Anumber of numerical ex...

In this paper, design alternatives for supporting realtime traffic in a differentiated services IP network node are studied. A scheduling algorithm called weighted earliest due date (WEDD) is proposed that provides tunable delay differentiation for applications like video or voice over IP. WEDD enhances the earliest due date (EDD) scheduling mechanism in such a way that not only different delay...

Production scheduling deals with scheduling production jobs on a machine (single or multiple) in order to optimise a specific objective such as total weighted completion times or total weighted tardiness. The assumption that machines are always available for processing jobs is generally used in the production scheduling literature. In reality, machines often are unavailable due to preventive ma...

Scheduling is an important subject of production and operations management area. In flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. The concept of transportation time is very important in scheduling. Transportation can be done by robots. In situations that robots are used to transpor...