Pages that link to "Item:Q2892311"
From MaRDI portal
The following pages link to Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria (Q2892311):
Displayed 11 items.
- A note on ``Two-machine flow-shop scheduling with rejection'' and its link with flow-shop scheduling and common due date assignment (Q339677) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- Preprocessing for a map sectorization problem by means of mathematical programming (Q490244) (← links)
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances (Q969755) (← links)
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization (Q1628126) (← links)
- A constraint generation approach for two-machine shop problems with jobs selection (Q1751902) (← links)
- An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines (Q1926814) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines (Q2342672) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) (← links)
