𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Human and machine effects in a just-in-time scheduling problem

✍ Scribed by Tamer Eren

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
64 KB
Volume
19
Category
Article
ISSN
1090-8471

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

In this article, single‐machine scheduling problems with learning effects of setup and removal times and deterioration effects of processing time are considered. The objective function of the problem is minimization of the weighted sum of total earliness and total tardiness. To get an exact solution to the problem, a mathematical programming model is proposed. Also the model is tested on an example. To the best of our knowledge, no work exists in the literature that considers the problem presented in this article. Β© 2009 Wiley Periodicals, Inc.

πŸ“œ SIMILAR VOLUMES

A note on β€œHuman and Machine Effects in
A note on β€œHuman and Machine Effects in a Just-In-Time Scheduling Problem” [Eren, T. (2009). Human Factors and Ergonomics in Manufacturing, 19(4), 294–299]
✍ Dehua Xu; Yunqiang Yin πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 48 KB

## Abstract The aim of this article is to point out some flaws in the mathematical programming model proposed by Tamer Eren [Human and Machine Effects in a Just‐In‐Time Scheduling Problem, Human Factors and Ergonomics in Manufacturing, 19(4), 294–299 (2009)]. Ignoring these flaws may cause unexpect

Makespan minimization in the two-machine
Makespan minimization in the two-machine flowshop batch scheduling problem
✍ T.C.E. Cheng; B.M.T. Lin; A. Toker πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 202 KB πŸ‘ 2 views

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part-types are to be produced in a flexible manufacturing cell organized into a two-stage production line. The jobs are processed in batches on the first

A note on the single-machine scheduling
A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
✍ Suresh Chand; Hans Schneeberger πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 328 KB

This paper analyzes the Smith-heuristic for the single-machine scheduling problem where the objective is to minimize the total weighted completion time subject to the constraint that the tardiness for any job does not exceed a prespecified maximum allowable tardiness. We identify several cases of th

Minimizing weighted earliness and tardin
Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted
✍ Jaw-Yeh Chen; Sheng-Fuu Lin πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 169 KB

## Abstract In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a br