Resource loading with time windows
From MaRDI portal
Publication:319369
DOI10.1016/j.ejor.2015.01.036zbMath1346.90475MaRDI QIDQ319369
Kameng Nip, Fabrice Talla Nobibon, Roel Leus, Zhen-bo Wang
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/480088
90B35: Deterministic scheduling theory in operations research
90B70: Theory of organizations, manpower planning in operations research
Related Items
Polyhedral Results and Branch-and-Cut for the Resource Loading Problem, Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MIP models for resource-constrained project scheduling with flexible resource profiles
- Mathematical programming algorithms for bin packing problems with item fragmentation
- A branch and price solution approach for order acceptance and capacity planning in make-to-order operations
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- Order acceptance with weighted tardiness
- Scheduling semi-malleable jobs to minimize mean flow time
- Scheduling for parallel processing
- A priority-rule method for project scheduling with work-content constraints
- Scheduling projects with variable-intensity activities: The case of dynamic earliness and tardiness costs
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- Parallel machine scheduling with splitting jobs
- A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time
- Workload based order acceptance in job shop environments
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- Hierarchical models for multi-project planning and scheduling
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- Approximating the Throughput of Multiple Machines in Real-Time Scheduling
- Complexity and approximability of the maximum flow problem with minimum quantities
- The Capacitated Lot-Sizing Problem with Linked Lot Sizes
- Multiple resource leveling in construction systems through variation of activity intensities
- Dynamic order acceptance and capacity planning on a single bottleneck resource
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- Parallel machine scheduling considering a job-splitting property
- Scenario-based approach for flexible resource loading under uncertainty
- Techniques for scheduling with rejection
- From Project to Process Management: An Empirically-Based Framework for Analyzing Product Development Time
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- Production Planning by Mixed Integer Programming
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Scheduling Jobs on Several Machines with the Job Splitting Property
- Scheduling
