Pages that link to "Item:Q757232"
From MaRDI portal
The following pages link to Parallel machines scheduling with nonsimultaneous machine available time (Q757232):
Displayed 50 items.
- An on-line scheduling problem of parallel machines with common maintenance time (Q394448) (← links)
- Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
- Makespan minimization for parallel machines scheduling with multiple availability constraints (Q744645) (← links)
- Optimal scheduling of a two-stage hybrid flow shop (Q857819) (← links)
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
- Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines (Q906399) (← links)
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan (Q941557) (← links)
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
- Parallel machine scheduling with multiple unloading servers (Q983625) (← links)
- Minimizing the sum of job completion times on capacitated two-parallel machines (Q1014943) (← links)
- Scheduling interfering job sets on parallel machines (Q1042099) (← links)
- The exact bound of Lee's MLPT (Q1130187) (← links)
- A general lower bound for the makespan problem (Q1266724) (← links)
- Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times (Q1271384) (← links)
- Two-machine flowshop scheduling with availability constraints (Q1296377) (← links)
- A new tabu search procedure for an audit-scheduling problem (Q1297694) (← links)
- The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines (Q1304470) (← links)
- Scheduling with incompatible jobs (Q1343141) (← links)
- Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times (Q1355924) (← links)
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint (Q1362517) (← links)
- Uniform machine scheduling with machine available constraints (Q1568243) (← links)
- Machine scheduling with a rate-modifying activity (Q1592740) (← links)
- Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times (Q1609082) (← links)
- Scheduling jobs with maintenance subject to load-dependent duration on a single machine (Q1664968) (← links)
- Parallel-machine scheduling with non-simultaneous machine available time (Q1667812) (← links)
- Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658) (← links)
- Scheduling on uniform processors with at most one downtime on each machine (Q1751114) (← links)
- Scheduling identical parallel machines with tooling constraints (Q1752870) (← links)
- The effect of machine availability on the worst-case performance of LPT (Q1775060) (← links)
- Optimal parallel machines scheduling with availability constraints (Q1775061) (← links)
- Parallel machines scheduling with machine shutdowns (Q1806577) (← links)
- The multifit algorithm for set partitioning containing kernels (Q1807874) (← links)
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints. (Q1853092) (← links)
- Single-machine scheduling with periodic maintenance and nonresumable jobs. (Q1868816) (← links)
- Parallel machine scheduling under a grade of service provision (Q1879792) (← links)
- Makespan minimization for two parallel machines with an availability constraint (Q1887910) (← links)
- Three-partitioning containing kernels: Complexity and heuristic (Q1924322) (← links)
- A note on ''parallel machine scheduling with non-simultaneous machine available time'' (Q1962027) (← links)
- Scheduling with limited machine availability (Q1969884) (← links)
- A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system (Q2052988) (← links)
- Streaming algorithms for multitasking scheduling with shared processing (Q2166248) (← links)
- Parallel machine scheduling with machine availability and eligibility constraints (Q2384614) (← links)
- Exact performance of MULTIFIT for nonsimultaneous machines (Q2440111) (← links)
- Scheduling two-stage hybrid flow shop with availability constraints (Q2496033) (← links)
- Optimal online algorithms for scheduling on two identical machines under a grade of service (Q2508148) (← links)
- Machine scheduling with an availability constraint (Q2564885) (← links)
- Machine scheduling performance with maintenance and failure (Q2643755) (← links)
- Scheduling with Deteriorating Jobs and Non-Simultaneous Machine Available Times (Q2788530) (← links)
- A SEMI-ON-LINE SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME (Q2920365) (← links)