Resource loading with time windows (Q319369)

From MaRDI portal

Revision as of 16:39, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Resource loading with time windows	scientific article

Statements

scholarly article

0 references

Resource loading with time windows (English)

0 references

Fabrice Talla Nobibon

0 references

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

6 October 2016

0 references

full work available at URL

https://lirias.kuleuven.be/handle/123456789/480088

0 references

zbMATH Keywords

resource loading

0 references

complexity theory

0 references

manpower planning

0 references

preemption

0 references

MaRDI profile type

MaRDI publication profile

0 references

From Project to Process Management: An Empirically-Based Framework for Analyzing Product Development Time

0 references

0 references

Satisfiability tests and time-bound adjustments for cumulative scheduling problems

0 references

Approximating the Throughput of Multiple Machines in Real-Time Scheduling

0 references

Mathematical programming algorithms for bin packing problems with item fragmentation

0 references

0 references

Scheduling for parallel processing

0 references

Workload based order acceptance in job shop environments

0 references

Techniques for scheduling with rejection

0 references

A priority-rule method for project scheduling with work-content constraints

0 references

0 references

Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width

0 references

Scheduling semi-malleable jobs to minimize mean flow time

0 references

Dynamic order acceptance and capacity planning on a single bottleneck resource

0 references

Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme

0 references

Linear-Time approximation schemes for scheduling malleable parallel tasks

0 references

0 references

0 references

Parallel machine scheduling considering a job-splitting property

0 references

A branch-and-cut algorithm for scheduling of projects with variable-intensity activities

0 references

Scheduling projects with variable-intensity activities: The case of dynamic earliness and tardiness costs

0 references

Multiple resource leveling in construction systems through variation of activity intensities

0 references

A branch and price solution approach for order acceptance and capacity planning in make-to-order operations

0 references

An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

0 references

A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks

0 references

MIP models for resource-constrained project scheduling with flexible resource profiles

0 references

0 references

Production Planning by Mixed Integer Programming

0 references

A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time

0 references

Scheduling Jobs on Several Machines with the Job Splitting Property

0 references

Order acceptance with weighted tardiness

0 references

Hierarchical models for multi-project planning and scheduling

0 references

The Capacitated Lot-Sizing Problem with Linked Lot Sizes

0 references

Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment

0 references

Complexity and approximability of the maximum flow problem with minimum quantities

0 references

Project Scheduling with Continuously-Divisible, Doubly Constrained Resources

0 references

Scenario-based approach for flexible resource loading under uncertainty

0 references

Parallel machine scheduling with splitting jobs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejor.2015.01.036

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:319369

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q319369&oldid=36277105"