An efficiently total dominating set of a graph G is a subset of its vertices such that each vertex of G is adjacent to exactly one vertex of the subset. If there is such a subset, then G is an efficiently total dominable graph (G is etd). In this paper, we prove NP-completeness of the etd decision problem on the class of planar bipartite graphs of maximum degree 3. Furthermore, we give an effic...

this paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. the fuzzy set theory is applied to describe this situation. a novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. due to the computational complexities, the prop...

Focusing on the just-in-time (JIT) operations management, earliness as well as, tardiness of jobs’ production and delivery should be discouraged. In accordance to this philosophy, scheduling problems involving earliness and tardiness penalties are very critical for the operations manager. In this paper, a new population heuristic based on the particle swarm optimization (PSO) technique is prese...

This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...

A combination of cDNA-amplified fragment length polymorphism (AFLP) and bulked segregant analysis (BSA) was used to identify genes co-segregating with earliness of tuberization in a diploid potato population. This approach identified 37 transcript-derived fragments with a polymorphic segregation pattern between early and late tuberizing bulks. Most of the identified transcripts mapped to chromo...

This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...

We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncertain. We use scenario-based stochastic programming with recourse to model the uncertainty in customers and robust optimization for the uncertainty in service times. Our proposed model generates a master plan and daily s...

This paper considers the SLK/DIF due window assignment problems on a single machine with general job-dependent positional effect, where actual processing time of job is subject to and effect. Production schedulers may decide outsource/reject some jobs by paying corresponding costs. Based whether accept tardiness jobs, we consider two different objectives under slack assignment, respectively. Th...

While almost all existing works which optimally solve just-in-time scheduling problems propose dedicated algorithmic approaches, we in this work mixed integer formulations. We consider a single machine problem that aims at minimizing the weighted sum of earliness–tardiness penalties around common due date. Using natural variables, provide one compact formulation for unrestrictive case and, gene...

Under just-in-time production, this paper studies a single machine common due-window (denoted by CONW) assignment scheduling problem with position-dependent weights and resource allocations. A job’s actual processing time can be determined the assigned to job. allocation model is divided into linear convex models, our goal find an optimal location, job sequence allocation. We prove that weighte...