Pages that link to "Item:Q3394051"
From MaRDI portal
The following pages link to Fifty years of scheduling: a survey of milestones (Q3394051):
Displaying 34 items.
- New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop (Q339585) (← links)
- A branch-and-bound algorithm for minimizing the energy consumption in the PFS problem (Q473807) (← links)
- Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence (Q490158) (← links)
- Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem (Q494929) (← links)
- A mathematical model for the management of a service center (Q636490) (← links)
- A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
- The Pareto frontier of inefficiency in mechanism design (Q777959) (← links)
- An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times (Q1644059) (← links)
- An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
- Scheduling cleaning activities on trains by minimizing idle times (Q1707827) (← links)
- A local search algorithm for the flow shop scheduling problem with release dates (Q1723292) (← links)
- A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates (Q1956018) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
- Flow shop scheduling with heterogeneous workers (Q2254003) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines (Q2305020) (← links)
- Multi-objective open shop scheduling by considering human error and preventive maintenance (Q2307240) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
- Optimizing makespan and stability risks in job shop scheduling (Q2664315) (← links)
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines (Q2664447) (← links)
- Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates (Q2792935) (← links)
- Minimizing Total Idle Energy Consumption in the Permutation Flow Shop Scheduling Problem (Q4561176) (← links)
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop (Q5058765) (← links)
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem (Q5103873) (← links)
- On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem (Q5168014) (← links)
- A simulation‐based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations (Q5416762) (← links)
- Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties (Q6046629) (← links)
- (Q6065401) (← links)
- Literature reviews in operations research: a new taxonomy and a meta review (Q6106580) (← links)
- Firefly-Inspired Algorithm for Job Shop Scheduling (Q6163642) (← links)