Order scheduling in an environment with dedicated resources in parallel
From MaRDI portal
Recommendations
- Scheduling orders for multiple product types to minimize total weighted completion time
- Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
- Scheduling orders for multiple product types with due date related objectives
- scientific article; zbMATH DE number 2221456
- Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
Cites work
- scientific article; zbMATH DE number 3633982 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Minimizing Total Tardiness on One Machine is NP-Hard
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Open shops with jobs overlap
- Open shops with jobs overlap -- revisited
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Cited in
(38)- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
- The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
- New approximate algorithms for the customer order scheduling problem with total completion time objective
- Metaheuristics for order scheduling problem with unequal ready times
- Order scheduling with tardiness objective: improved approximate solutions
- The complexity of customer order scheduling problems on parallel machines
- Tailoring customer order scheduling search algorithms
- Scheduling fully parallel jobs
- Scheduling with constrained processor allocation for interval orders
- Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
- The representation of partially-concurrent open shop problems
- Preemptive multiprocessor order scheduling to minimize total weighted flowtime
- Scheduling orders for multiple product types with due date related objectives
- Integrated production and transportation scheduling with order-dependent inventory holding costs
- A learning-based two-stage optimization method for customer order scheduling
- Assembly flowshop scheduling problem: speed-up procedure and computational evaluation
- Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time
- Scheduling fully parallel jobs with integer parallel units
- Scheduling with centralized and decentralized batching policies in concurrent open shops
- An order scheduling problem with position-based learning effect
- Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
- Cost-sharing mechanisms for scheduling under general demand settings
- Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms
- The customer order lead-time problem on parallel machines
- scientific article; zbMATH DE number 2221456 (Why is no real title available?)
- Minimizing the sum of weighted completion times in a concurrent open shop
- An approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties
- Solving customer order scheduling problems with an iterated greedy algorithm
- Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment
- Stochastic customer order scheduling to minimize long-run expected order cycle time
- Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties
- Customer order scheduling on a serial-batch machine in precast bridge construction
- Approximation algorithms for the parallel-machine customer order scheduling with weighted and submodular rejection penalties
- Minimizing maximum delivery completion time for order scheduling with rejection
- Customer order scheduling on a single machine with family setup times: complexity and algorithms
- A note on the complexity of the concurrent open shop problem
- Scheduling orders for multiple product types to minimize total weighted completion time
- Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
This page was built for publication: Order scheduling in an environment with dedicated resources in parallel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880508)
