Shifting bottleneck heuristics for job-shop scheduling

Download
1999
İnan, Mustafa

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 ...
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...
Scheduling Status Updates to Minimize Age of Information with an Energy Harvesting Sensor
Bacınoğlu, Baran Tan; Uysal, Elif (2017-06-30)
Age of Information is a measure of the freshness of status updates in monitoring applications and update-based systems. We study a real-time sensing scenario with a sensor which is restricted by time-varying energy constraints and battery limitations. The sensor sends updates over a packet erasure channel with no feedback. The problem of finding an age-optimal threshold policy, with the transmission threshold being a function of the energy state and the estimated current age, is formulated. The average age ...
Citation Formats
M. İnan, “Shifting bottleneck heuristics for job-shop scheduling,” Middle East Technical University, 1999.