Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan
From MaRDI portal
Publication:6113846
DOI10.1007/978-3-031-22105-7_20OpenAlexW4313351024MaRDI QIDQ6113846
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22105-7_20
Cites Work
- Unnamed Item
- A survey on offline scheduling with rejection
- New approximation algorithms for machine scheduling with rejection on single and parallel machine
- Minimizing maximum delivery completion time for order scheduling with rejection
- A survey of results for sequencing problems with controllable processing times
- Single machine scheduling with release dates and rejection
- A bicriterion approach to time/cost trade-offs in sequencing
- Preemptive scheduling with rejection
- Two machine mixed shop scheduling problem with controllable machine speeds
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- On the parameterized tractability of single machine scheduling with rejection
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
- Flowshop scheduling with learning effect and job rejection
- A survey of scheduling with controllable processing times
- Single machine scheduling with controllable release and processing parameters
- Scheduling with partial rejection
- TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
- Techniques for scheduling with rejection
- Multiprocessor Scheduling with Rejection
- Combinatorial optimization. Theory and algorithms
This page was built for publication: Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan
