Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
0 answers
20 views

Interval scheduling maximization problem (ISMP) variation with flexible start time and common deadline

I'm trying to find an optimal algorithm for ISMP variation, with 2 additional details: the start of any interval can be moved forward and there's a common 'deadline' for all intervals. Given: Set of ...
user175320's user avatar
2 votes
1 answer
158 views

Scheduling algorithm for a student's study times given assignments, expected time, due dates, and class times

I would like to create an algorithm that advises a student when they should work on certain assignments given the expected time each assignment will take, and the due date of each assignment. Say that ...
bigCSm8's user avatar
  • 21
1 vote
1 answer
167 views

Scheduling of process manufacturing with setup times

Overview The process manufacturing is (in contrast to discrete manufacturing) focused on the production of continuous goods such as oil. The planning is typically solvable by means of Linear ...
Karel Macek's user avatar
1 vote
0 answers
80 views

Appropriate algorithm or heuristic for task scheduling

I'm sure this problem has been addressed before, but I'm unable to find an exact description of it. I have $m$ machines, and $n$ tasks that need processing. Each task takes a variable amount of ...
geoff's user avatar
  • 11
2 votes
0 answers
165 views

long-lived scheduling using max-flow & push/relabel

I'm writing a scheduler of long-lived Processors which execute long-lived Tasks. Processors and Tasks may each come and go over time, at any time (when a Processor departs, its assigned Tasks now ...
Johnny Graettinger's user avatar
0 votes
1 answer
175 views

How to schedule n jobs that come at different times on 1 machine (each taking a different time to complete the task)?

Let's say I have to do n jobs, and each job can be done at or after a time T(i) (1<=i<=n). And we have 1 machine and the machine takes a time M to do any job whatsoever. The machine once started ...
Indo Ubt's user avatar
  • 221
2 votes
0 answers
43 views

Identify common mathematical problem behind my task in scheduling area

Having single operator, which could do work and it's time of availability - for example from 8 am till 9 pm. And operator have limited resource - let's call it ...
Ph0en1x's user avatar
  • 141
3 votes
1 answer
734 views

A variant of job assignment (scheduling) problem with variable time span

The problem is a scheduling problem with n jobs and k machines. Each job i can be started at any time, but its duration is not exactly known except a time span interval. For example, a job may take ...
Mohsen's user avatar
  • 31