The following pages link to Multicriteria scheduling (Q2566699):
Displaying 50 items.
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness (Q295879) (← links)
- Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (Q296690) (← links)
- Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan (Q300969) (← links)
- Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness (Q306084) (← links)
- Total completion time minimization on multiple machines subject to machine availability and makespan constraints (Q319146) (← links)
- Practical solutions for a dock assignment problem with trailer transportation (Q319870) (← links)
- Optimizing emergency preparedness and resource utilization in mass-casualty incidents (Q323561) (← links)
- Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334) (← links)
- Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns (Q336423) (← links)
- Improving schedule stability in single-machine rescheduling for new operation insertion (Q342084) (← links)
- Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom (Q342113) (← links)
- Adaptive online scheduling of tasks with anytime property on heterogeneous resources (Q342556) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines (Q391787) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- Multi-criteria scheduling: an agent-based approach for expert knowledge integration (Q398857) (← links)
- On bilevel machine scheduling problems (Q421065) (← links)
- Bi-criteria scheduling on a single parallel-batch machine (Q437901) (← links)
- Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost (Q457296) (← links)
- A note on unbounded parallel-batch scheduling (Q495685) (← links)
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem (Q630678) (← links)
- Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints (Q631768) (← links)
- A mathematical model for the management of a service center (Q636490) (← links)
- A unified framework for population-based metaheuristics (Q646652) (← links)
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
- Scheduling to minimize the maximum total completion time per machine (Q726222) (← links)
- A classification of predictive-reactive project scheduling procedures (Q835548) (← links)
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
- A multi-criteria approach for scheduling semiconductor wafer fabrication facilities (Q835581) (← links)
- Bicriteria robotic cell scheduling (Q835626) (← links)
- Considering manufacturing cost and scheduling performance on a CNC turning machine (Q856225) (← links)
- A (0-1) goal programming model for scheduling the tour of a marketing executive (Q858472) (← links)
- Scheduling parallel CNC machines with time/cost trade-off considerations (Q875425) (← links)
- Pareto minimizing total completion time and maximum cost with positional due indices (Q888315) (← links)
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
- Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (Q941545) (← links)
- Single-machine scheduling under the job rejection constraint (Q964407) (← links)
- A search method for optimal control of a flow shop system of traditional machines (Q976446) (← links)
- A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835) (← links)
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan (Q995579) (← links)
- A multi-criteria scheduling with due-window assignment problem (Q1007672) (← links)
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties (Q1017438) (← links)
- Bicriteria robotic operation allocation in a flexible manufacturing cell (Q1040977) (← links)
- Non-approximability of just-in-time scheduling (Q1041346) (← links)
- Scheduling interfering job sets on parallel machines (Q1042099) (← links)
- New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs (Q1044141) (← links)
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case (Q1046704) (← links)
- On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
- Bounded serial-batching scheduling for minimizing maximum lateness and makespan (Q1751110) (← links)
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints (Q1751234) (← links)
