Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
From MaRDI portal
Publication:1617277
DOI10.1007/s10951-017-0543-zzbMath1406.90049OpenAlexW2763446989MaRDI QIDQ1617277
Publication date: 7 November 2018
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-017-0543-z
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
An exact algorithm for the preemptive single machine scheduling of equal-length jobs ⋮ Scheduling with day shifts and breaks ⋮ Research on construction and application for the model of multistage job shop scheduling problem
Cites Work
- Single machine scheduling with two competing agents and equal job processing times
- Temperature aware online algorithms for scheduling equal length jobs
- Semi-online scheduling with two GoS levels and unit processing time
- Scheduling a variable maintenance and linear deteriorating jobs on a single machine
- Scheduling of coupled tasks with unit processing times
- Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
- Scheduling jobs under increasing linear machine maintenance time
- Scheduling with tool changes to minimize total completion time under controllable machining conditions
- A note on worst-case performance of heuristics for maintenance scheduling problems
- Due-window assignment problems with unit-time jobs
- Due dates assignment and JIT scheduling with equal-size jobs
- A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness
- Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- Equal processing time bicriteria scheduling on parallel machines
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
- Online scheduling of incompatible unit-length job families with lookahead
- Due-window assignment with identical jobs on parallel uniform machines
- Complexity of integer quasiconvex polynomial optimization
- An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs
- Homogeneously non-idling schedules of unit-time jobs on identical parallel machines
- An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- Optimal two- and three-stage production schedules with setup times included
- Integer Programming with a Fixed Number of Variables
- Scheduling the maintenance on a single machine
- Nonlinear Integer Programming
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
- Scheduling
- Minmax earliness-tardiness costs with unit processing time jobs
- On preemption redundancy in scheduling unit processing time jobs on two parallel machines
This page was built for publication: Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
