Order acceptance and scheduling with delivery under generalized parameters
From MaRDI portal
Recommendations
- Minimizing maximum delivery completion time for order scheduling with rejection
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- scientific article; zbMATH DE number 4172724
- On the complexity of generalized due date scheduling problems
Cites work
- A note on the SPT heuristic for solving scheduling problems with generalized due dates
- A survey on offline scheduling with rejection
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Coordinated scheduling of the outsourcing, in-house production and distribution operations
- Flowshop scheduling with learning effect and job rejection
- scientific article; zbMATH DE number 4172724 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- In-house production and outsourcing under different discount schemes on the total outsourcing cost
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Integrated Scheduling of Production and Distribution Operations
- Machine scheduling with transportation considerations
- Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
- Minimizing total late work on a single machine with generalized due-dates
- Minimizing Total Tardiness on One Machine is NP-Hard
- Multiprocessor Scheduling with Rejection
- New approximation algorithms for machine scheduling with rejection on single and parallel machine
- On the complexity of generalized due date scheduling problems
- On the parameterized tractability of single machine scheduling with rejection
- Online scheduling with known arrival times
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Preemptive scheduling with rejection
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
- Scheduling with partial rejection
- Single machine scheduling with assignable due dates
- Single machine scheduling with outsourcing under different fill rates or quantity discount rates
- Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs
- Single machine scheduling with release dates and rejection
- Single-machine scheduling with maintenance activities and rejection
- Techniques for scheduling with rejection
- Two-agent single-machine scheduling with assignable due dates
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
- Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates
- Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
This page was built for publication: Order acceptance and scheduling with delivery under generalized parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179281)
