Shifting bottleneck heuristics for job-shop scheduling

Download
082639.pdf
1999
İnan, Mustafa
Show full item record
53
views
0
downloads
https://hdl.handle.net/11511/2142
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Scheduling preventive maintenance on a single CNC machine
Gürel, Sinan (2008-01-01)
In this study we attempt to deal with process planning, scheduling and preventive maintenance (PM) decisions, simultaneously. The objective is to minimize the total completion time of a set of jobs on a CNC machine. During the process planning, we decide on the processing times of the jobs which are controllable (i.e. they can be easily changed) on CNC machines. Using shorter processing times (higher production rates) would result in greater deterioration of the machine, and we would need to plan more frequ...
Scheduling job families about an unrestricted common due date on a single machine
Azizoğlu, Meral (1997-01-01)
We consider the NP-hard problem of scheduling jobs on a single machine about an unrestricted due date to minimize total weighted earliness and tardiness cost. Jobs are grouped into families where jobs in the same family share a setup; a setup time is required between the processing of two jobs from different families. Each job has an earliness penalty rate and a tardiness penalty rate that are allowed to be arbitrary. These rates are assessed on a per-period basis when the completion time deviates from its ...
Scheduling a dual gripper material handling robot with energy considerations
Gürel, Sinan; Gultekin, Hakan; Emiroglu, Nurdan (2023-04-01)
Robotic cells are serial production systems that consist of a number of machines and a material handling robot that transfers parts between the machines. Energy consumption of a robot during its move between two machines can be decreased by carefully selecting its speed. This paper presents models and algorithms that make robot speed and robot activity sequencing decisions together for a dual-gripper robot that can handle two parts simultaneously. We consider both robot energy consumption and cycle time obj...
Switching reference frame preferences during verbally assisted haptic graph comprehension
Alacam, Oezge; Habel, Christopher; Acartürk, Cengiz (2015-09-01)
Haptic-audio interfaces allow haptic exploration of statistical line graphs accompanied by sound or speech, thus providing access to exploration by visually impaired people. Verbally assisted haptic graph exploration can be seen as a task-oriented collaborative activity between two partners, a haptic explorer and an observing assistant, who are disposed to individual preferences for using reference frames. The experimental findings reveal that haptic explorers' spatial reference frames are mostly induced by...
Scheduling in two-machine robotic cells with a self-buffered robot
Gündoğdu, Emine; GÜLTEKİN, HAKAN (2016-02-01)
This study considers a production cell consisting of two machines and a material handling robot. The robot has a buffer space that moves with it. Identical parts are to be produced repetitively in this flowshop environment. The problem is to determine the cyclic schedule of the robot moves that maximizes the throughput rate. After developing the necessary framework to analyze such cells, we separately consider the single-, double-, and infinite-capacity buffer cases. For single- and double-capacity cases, c...
Citation Formats
M. İnan, “Shifting bottleneck heuristics for job-shop scheduling,” Middle East Technical University, 1999.
METU IIS - Integrated Information Service open@metu.edu.tr