Pages that link to "Item:Q2773166"

The following pages link to Multicriteria scheduling problems: a survey (Q2773166):

Displaying 50 items.

• Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
• MP or not MP: that is the question (Q283264) (← links)
• Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (Q296690) (← links)
• Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
• Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption (Q320777) (← links)
• Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334) (← links)
• On optimizing a bi-objective flowshop scheduling problem in an uncertain environment (Q356401) (← links)
• A survey on offline scheduling with rejection (Q398830) (← links)
• Multi-criteria scheduling: an agent-based approach for expert knowledge integration (Q398857) (← links)
• Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres (Q439612) (← links)
• Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost (Q457296) (← links)
• Constrained clustering by constraint programming (Q511767) (← links)
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (Q856080) (← links)
• An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems (Q869006) (← links)
• Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
• Skilled workforce scheduling in service centres (Q954927) (← links)
• Due dates assignment and JIT scheduling with equal-size jobs (Q976442) (← links)
• A parallel multiple reference point approach for multi-objective optimization (Q976459) (← links)
• Analyzing scheduling with transient failures (Q987815) (← links)
• Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions (Q1011174) (← links)
• A tabu search algorithm for scheduling pharmaceutical packaging operations (Q1039804) (← links)
• Approximation results for a bicriteria job scheduling problem on a single machine without preemption (Q1041716) (← links)
• Scheduling interfering job sets on parallel machines (Q1042099) (← links)
• Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case (Q1046704) (← links)
• Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
• Incorporating preference information into multi-objective scheduling (Q1333459) (← links)
• On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
• Heuristics for hybrid flow shops with controllable processing times and assignable due dates (Q1603337) (← links)
• Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (Q1615940) (← links)
• Competitive multi-agent scheduling with an iterative selection rule (Q1743639) (← links)
• No-wait flowshop scheduling problem with two criteria; total tardiness and makespan (Q1750472) (← links)
• Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints (Q1751234) (← links)
• The resource dependent assignment problem with a convex agent cost function (Q1753596) (← links)
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
• Minimizing the number of late jobs when the start time of the machine is variable (Q1758276) (← links)
• An analysis of cyclic scheduling problems in robot centered cells (Q1762114) (← links)
• Maximization of solution flexibility for robust shop scheduling (Q1772837) (← links)
• Earliness-tardiness scheduling with setup considerations (Q1777159) (← links)
• Two-machine flowshop scheduling with a secondary criterion (Q1870802) (← links)
• Makespan minimization subject to flowtime optimality on identical parallel machines (Q1885968) (← links)
• Rescheduling for new orders on a single machine with setup times (Q1926981) (← links)
• Bicriterion scheduling with a negotiable common due window and resource-dependent processing times (Q2004709) (← links)
• Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
• Scheduling batches in flowshop with limited buffers in the shampoo industry (Q2253374) (← links)
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
• The hybrid flow shop scheduling problem (Q2270289) (← links)
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
• Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost (Q2333219) (← links)
• Interactive bicriterion decision support for a large scale industrial scheduling system (Q2347596) (← links)