Multi-machine scheduling with interval constrained position-dependent processing times
From MaRDI portal
Publication:1716992
Recommendations
- Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times
- Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times
- Multi-machine scheduling with general position-based deterioration to minimize total load revisited
- Algorithms and Computation
- Two-agent scheduling problems with the general position-dependent processing time
Cites work
- A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows
- A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints
- Algorithms for Scheduling Independent Tasks
- Algorithms for the Assignment and Transportation Problems
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
- An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
- An extension of the Munkres algorithm for the assignment problem to rectangular matrices
- Bounds for Certain Multiprocessing Anomalies
- Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
- Multi-machine scheduling with general position-based deterioration to minimize total load revisited
- Revised delivery-time quotation in scheduling with tardiness penalties
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling linear deteriorating jobs with rejection on a single machine
- Scheduling with general job-dependent learning curves.
- Scheduling with job-dependent learning effects and multiple rate-modifying activities
- Single machine scheduling with aging effect and upper-bounded actual processing times
- Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration
- Single-machine scheduling with learning considerations
- Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration
- Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times
- Techniques for scheduling with rejection
- Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
- V-Shaped Policies for Scheduling Deteriorating Jobs
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
Cited in
(7)- Exploring a resolution method based on an evolutionary game-theoretical model for minimizing the machines with limited workload capacity and interval constraints
- A multi-period machine assignment problem
- Parallel-machine scheduling with potential disruption and positional-dependent processing times
- Machine scheduling with contiguous processing constraints
- Busy time scheduling on a bounded number of machines (extended abstract)
- Explicit Modelling of Multiple Intervals in a Constraint Generation Procedure for Multiprocessor Scheduling
- Scheduling in multi-scenario environment with an agreeable condition on job processing times
This page was built for publication: Multi-machine scheduling with interval constrained position-dependent processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1716992)
