Revisiting the development trajectory of parallel machine scheduling
From MaRDI portal
Cites work
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- A flow-based formulation for parallel machine scheduling using decision diagrams
- A GRASP for parallel machine scheduling with time windows
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- A state-of-the-art review of parallel-machine scheduling research
- A survey of scheduling with parallel batch (p-batch) processing
- A survey on scheduling problems with due windows
- An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
- Bicriteria scheduling of equal length jobs on uniform parallel machines
- Community structure in social and biological networks
- Data envelopment analysis application in sustainability: the origins, development and future directions
- Decomposition methods for the parallel machine scheduling problem with setups
- Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- Fast approximation algorithms for job scheduling with processing set restrictions
- Heuristic and exact algorithms for the identical parallel machine scheduling problem
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- scientific article; zbMATH DE number 1783886 (Why is no real title available?)
- scientific article; zbMATH DE number 232395 (Why is no real title available?)
- Literature reviews in operations research: a new taxonomy and a meta review
- Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
- Minimizing resource consumption on uniform parallel machines with a bound on makespan
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- Optimal semi-online algorithms for machine covering
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Ordinal on-line scheduling for maximizing the minimum machine completion time
- Parallel machine scheduling by column generation
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- Parallel machine scheduling with a common due window
- Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration
- Parallel machine scheduling with job assignment restrictions
- Parallel machine scheduling with nested processing set restrictions
- Parallel machine scheduling with splitting jobs
- Parallel machine scheduling, linear programming, and parameter list scheduling heuristics
- Parallel Machine Scheduling: Impact of Adding Extra Machines
- Parallel machines scheduling with deteriorating and learning effects
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
- Scheduling deteriorating jobs with a learning effect on unrelated parallel machines
- Scheduling parallel machines with inclusive processing set restrictions
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Scheduling unrelated parallel machines with sequence-dependent setups
- Scheduling with deadlines and loss functions
- Semi on-line algorithms for the partition problem
- Semi-on-line problems on two identical machines with combined partial information
- Semi-online scheduling with decreasing job sizes
- Solving Parallel Machine Scheduling Problems by Column Generation
- Unrelated machine scheduling with stochastic processing times
Cited in
(3)
This page was built for publication: Revisiting the development trajectory of parallel machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979446)
