The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- Preface to the special issue to the multidisciplinary international scheduling conference: theory and applications (MISTA), 2009, Volume 2 (Q2434253) (← links)
- Scheduling jobs on parallel machines to minimize a regular step total cost function (Q2434254) (← links)
- Erratum to: ``Scheduling jobs on parallel machines to minimize a regular step total cost function'' (Q2434255) (← links)
- Integrated batch sizing and scheduling on a single machine (Q2434256) (← links)
- Exact methods for the resource levelling problem (Q2434257) (← links)
- A system-centric metric for the evaluation of online job schedules (Q2434258) (← links)
- Open-shop dense schedules: properties and worst-case performance ratio (Q2434260) (← links)
- Comparing online algorithms for bin packing problems (Q2434261) (← links)
- Analysis of three mathematical models of the staff rostering problem (Q2434266) (← links)
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268) (← links)
- Absolute approximation ratios for packing rectangles into bins (Q2434269) (← links)
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270) (← links)
- Improved multi-processor scheduling for flow time and energy (Q2434271) (← links)
- Single machine scheduling with small operator-non-availability periods (Q2434272) (← links)
- Windows scheduling of arbitrary-length jobs on multiple machines (Q2434274) (← links)
- Efficiency analysis of load balancing games with and without activation costs (Q2434275) (← links)
- Single-machine scheduling with advanced process control constraints (Q2434278) (← links)
- Minimizing total tardiness on parallel machines with preemptions (Q2434279) (← links)
- Dynamic supply chain scheduling (Q2434280) (← links)
- Single-machine scheduling with no idle time and release dates to~minimize a regular criterion (Q2434281) (← links)
- A fuzzy random resource-constrained scheduling model with~multiple projects and its application to a working procedure in a large-scale water conservancy and hydropower construction project (Q2434282) (← links)
- A new variable-sized bin packing problem (Q2434283) (← links)
- Optimality proof of the Kise-Ibaraki-Mine algorithm (Q2434284) (← links)
- On Eulerian extensions and their application to no-wait flowshop scheduling (Q2434285) (← links)
- Single-machine multi-agent scheduling problems with a global objective function (Q2434286) (← links)
- Scheduling of pipelined operator graphs (Q2434287) (← links)
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
- An improved MIP-based approach for a multi-skill workforce scheduling problem (Q2434289) (← links)
- Semi-online two-level supply chain scheduling problems (Q2434290) (← links)
- On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time (Q2434291) (← links)
- Editorial: new branches, old roots (Q2434292) (← links)
- Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
- Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions (Q2434294) (← links)
- A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
- Scheduling with due date assignment under special conditions on job processing (Q2434296) (← links)
- Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints (Q2434297) (← links)
- Routing equal-size messages on a slotted ring (Q2434298) (← links)
- Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications (Q2434299) (← links)
- New bounds and algorithms for the transshipment yard scheduling problem (Q2434300) (← links)
- Scheduling flexible maintenance activities subject to job-dependent machine deterioration (Q2434301) (← links)
- Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms (Q2434302) (← links)
- Unbounded parallel-batching scheduling with two competitive agents (Q2434303) (← links)
- Online scheduling of bounded length jobs to maximize throughput (Q2434304) (← links)
- Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine (Q2434305) (← links)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
- Production scheduling with subcontracting: the subcontractor's pricing game (Q2434307) (← links)
- Scheduling to minimize gaps and power consumption (Q2434309) (← links)
- A linear programming-based method for job shop scheduling (Q2434310) (← links)
- Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity (Q2434311) (← links)
- Job-shop scheduling in a body shop (Q2434313) (← links)
